<!-- HTML header for doxygen 1.8.18-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Ipopt: Ipopt Options</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
  $(document).ready(function() { init_search(); });
/* @license-end */
</script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
  extensions: ["tex2jax.js"],
  jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js"></script>
<link href="stylesheet.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 40px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Ipopt Documentation
   &#160;<!--span id="projectnumber">3.14.17</span-->
   </div>
  </td>
   <td>        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <span id="MSearchSelect"                onmouseover="return searchBox.OnSearchSelectShow()"                onmouseout="return searchBox.OnSearchSelectHide()">&#160;</span>
          <input type="text" id="MSearchField" value="" placeholder="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.svg" alt=""/></a>
          </span>
        </div>
</td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search/",'.html');
/* @license-end */
</script>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('OPTIONS.html',''); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>

<div><div class="header">
  <div class="headertitle"><div class="title">Ipopt Options</div></div>
</div><!--header-->
<div class="contents">
<div class="toc"><h3>Table of Contents</h3>
<ul><li class="level1"><a href="#OPTIONS_AMPL">Options in the AMPL Interface</a></li>
<li class="level1"><a href="#OPTIONS_REF">Options Reference</a><ul><li class="level2"><a href="#OPT_Termination">Termination</a></li>
<li class="level2"><a href="#OPT_Output">Output</a></li>
<li class="level2"><a href="#OPT_NLP">NLP</a></li>
<li class="level2"><a href="#OPT_NLP_Scaling">NLP Scaling</a></li>
<li class="level2"><a href="#OPT_Initialization">Initialization</a></li>
<li class="level2"><a href="#OPT_Warm_Start">Warm Start</a></li>
<li class="level2"><a href="#OPT_Miscellaneous">Miscellaneous</a></li>
<li class="level2"><a href="#OPT_Barrier_Parameter_Update">Barrier Parameter Update</a></li>
<li class="level2"><a href="#OPT_Line_Search">Line Search</a></li>
<li class="level2"><a href="#OPT_Linear_Solver">Linear Solver</a></li>
<li class="level2"><a href="#OPT_Step_Calculation">Step Calculation</a></li>
<li class="level2"><a href="#OPT_Restoration_Phase">Restoration Phase</a></li>
<li class="level2"><a href="#OPT_Hessian_Approximation">Hessian Approximation</a></li>
<li class="level2"><a href="#OPT_Derivative_Checker">Derivative Checker</a></li>
<li class="level2"><a href="#OPT_MA27_Linear_Solver">MA27 Linear Solver</a></li>
<li class="level2"><a href="#OPT_MA57_Linear_Solver">MA57 Linear Solver</a></li>
<li class="level2"><a href="#OPT_MA77_Linear_Solver">MA77 Linear Solver</a></li>
<li class="level2"><a href="#OPT_MA86_Linear_Solver">MA86 Linear Solver</a></li>
<li class="level2"><a href="#OPT_MA97_Linear_Solver">MA97 Linear Solver</a></li>
<li class="level2"><a href="#OPT_Pardiso__pardiso_project_org__Linear_Solver">Pardiso (pardiso-project.org) Linear Solver</a></li>
<li class="level2"><a href="#OPT_Pardiso__MKL__Linear_Solver">Pardiso (MKL) Linear Solver</a></li>
<li class="level2"><a href="#OPT_SPRAL_Linear_Solver">SPRAL Linear Solver</a></li>
<li class="level2"><a href="#OPT_WSMP_Linear_Solver">WSMP Linear Solver</a></li>
<li class="level2"><a href="#OPT_Mumps_Linear_Solver">Mumps Linear Solver</a></li>
<li class="level2"><a href="#OPT_MA28_Linear_Solver">MA28 Linear Solver</a></li>
</ul>
</li>
</ul>
</div>
<div class="textblock"><p>Ipopt has many (maybe too many) options that can be adjusted for the algorithm.</p>
<p>Options are all identified by a string name, and their values can be of one of three types: Number (real), Integer, or String. Number options are used for things like tolerances, integer options are used for things like maximum number of iterations, and string options are used for setting algorithm details, like the NLP scaling method. Options can be set through the code that interfaces Ipopt (have a look at the examples to see how this is done) or by creating a <code>ipopt.opt</code> file in the directory you are executing Ipopt.</p>
<p>The <code>ipopt.opt</code> file is read line by line and each line should contain the option name, followed by whitespace, and then the value. Comments can be included with the <code>#</code> symbol. For example, </p><pre class="fragment"># This is a comment

# Turn off the NLP scaling
nlp_scaling_method none

# Change the initial barrier parameter
mu_init 1e-2

# Set the max number of iterations
max_iter 500
</pre><p> is a valid <code>ipopt.opt</code> file.</p>
<h1><a class="anchor" id="OPTIONS_AMPL"></a>
Options in the AMPL Interface</h1>
<p>To set options through AMPL, use the internal AMPL command options. For example, </p><pre class="fragment">options ipopt_options "nlp_scaling_method=none mu_init=1e-2 max_iter=500"
</pre><p> is a valid options command in AMPL. Further, you can always create <code>ipopt.opt</code>. Note, the <code>ipopt.opt</code> file is given preference when setting options. This way, you can easily override any options set in a particular executable or AMPL model by specifying new values in <code>ipopt.opt</code>.</p>
<p>All Ipopt options are also available through AMPL. In addition, these options are available:</p>
<table class="markdownTable">
<tr class="markdownTableHead">
<th class="markdownTableHeadLeft">Option   </th><th class="markdownTableHeadLeft">Description    </th></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">halt_on_ampl_error   </td><td class="markdownTableBodyLeft">Exit with message on evaluation error    </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">wantsol   </td><td class="markdownTableBodyLeft">solution report without -AMPL: sum of; 1 =&gt; write .sol file; 2 =&gt; print primal variable values; 4 =&gt; print dual variable values; 8 =&gt; do not print solution message    </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyLeft">maxit   </td><td class="markdownTableBodyLeft">Synonym for <a class="el" href="OPTIONS.html#OPT_max_iter">max_iter</a>    </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyLeft">outlev   </td><td class="markdownTableBodyLeft">Synonym for <a class="el" href="OPTIONS.html#OPT_print_level">print_level</a>   </td></tr>
</table>
<p>Running the AMPL solver executable with the "-=" flag from the command prompt prints a list of all options available in AMPL.</p>
<h1><a class="anchor" id="OPTIONS_REF"></a>
Options Reference</h1>
<p>A list of documented options is given next. Options that should be modified by expert users only are marked as <em>advanced</em>. You can print the documentation for all Ipopt options to the console by using the option <a class="el" href="OPTIONS.html#OPT_print_options_documentation">print_options_documentation</a> and running Ipopt. If you have the AMPL solver executable, you can generate this list also by calling the executable with flag <code>--print-options</code>.</p>
<dl class="section note"><dt>Note</dt><dd>Availability or default values of some options concerning the linear solver depends on the configuration used to build Ipopt. Use the print options documentation feature to see which options are available in a particular build of Ipopt.</dd></dl>
<p>The implementation paper mentioned for some options is <a class="el" href="citelist.html#CITEREF_WaecBieg06:mp">[12]</a>.</p>
<h2><a class="anchor" id="OPT_Termination"></a>
Termination</h2>
<p><a class="anchor" id="OPT_tol"></a><a href="#OPT_tol">&#x25B8;&nbsp;</a><b>tol</b>: Desired convergence tolerance (relative). </p><blockquote class="doxtable">
<p>Determines the convergence tolerance for the algorithm. The algorithm terminates successfully, if the (scaled) NLP error becomes smaller than this value, and if the (absolute) criteria according to "dual_inf_tol", "constr_viol_tol", and "compl_inf_tol" are met. This is epsilon_tol in Eqn. (6) in implementation paper. See also "acceptable_tol" as a second termination criterion. Note, some other algorithmic features also use this quantity to determine thresholds etc. The valid range for this real option is 0 &lt; tol and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_s_max"></a><a href="#OPT_s_max">&#x25B8;&nbsp;</a><b>s_max</b> (<em>advanced</em>): Scaling threshold for the NLP error. </p><blockquote class="doxtable">
<p>See paragraph after Eqn. (6) in the implementation paper. The valid range for this real option is 0 &lt; s_max and its default value is 100. </p>
</blockquote>
<p><a class="anchor" id="OPT_max_iter"></a><a href="#OPT_max_iter">&#x25B8;&nbsp;</a><b>max_iter</b>: Maximum number of iterations. </p><blockquote class="doxtable">
<p>The algorithm terminates with a message if the number of iterations exceeded this number. The valid range for this integer option is 0 &le; max_iter and its default value is 3000. </p>
</blockquote>
<p><a class="anchor" id="OPT_max_wall_time"></a><a href="#OPT_max_wall_time">&#x25B8;&nbsp;</a><b>max_wall_time</b>: Maximum number of walltime clock seconds. </p><blockquote class="doxtable">
<p>A limit on walltime clock seconds that <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> can use to solve one problem. If during the convergence check this limit is exceeded, <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> will terminate with a corresponding message. The valid range for this real option is 0 &lt; max_wall_time and its default value is 10<sup>+20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_max_cpu_time"></a><a href="#OPT_max_cpu_time">&#x25B8;&nbsp;</a><b>max_cpu_time</b>: Maximum number of CPU seconds. </p><blockquote class="doxtable">
<p>A limit on CPU seconds that <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> can use to solve one problem. If during the convergence check this limit is exceeded, <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> will terminate with a corresponding message. The valid range for this real option is 0 &lt; max_cpu_time and its default value is 10<sup>+20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_dual_inf_tol"></a><a href="#OPT_dual_inf_tol">&#x25B8;&nbsp;</a><b>dual_inf_tol</b>: Desired threshold for the dual infeasibility. </p><blockquote class="doxtable">
<p>Absolute tolerance on the dual infeasibility. Successful termination requires that the max-norm of the (unscaled) dual infeasibility is less than this threshold. The valid range for this real option is 0 &lt; dual_inf_tol and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_constr_viol_tol"></a><a href="#OPT_constr_viol_tol">&#x25B8;&nbsp;</a><b>constr_viol_tol</b>: Desired threshold for the constraint and variable bound violation. </p><blockquote class="doxtable">
<p>Absolute tolerance on the constraint and variable bound violation. Successful termination requires that the max-norm of the (unscaled) constraint violation is less than this threshold. If option bound_relax_factor is not zero 0, then <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> relaxes given variable bounds. The value of constr_viol_tol is used to restrict the absolute amount of this bound relaxation. The valid range for this real option is 0 &lt; constr_viol_tol and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_compl_inf_tol"></a><a href="#OPT_compl_inf_tol">&#x25B8;&nbsp;</a><b>compl_inf_tol</b>: Desired threshold for the complementarity conditions. </p><blockquote class="doxtable">
<p>Absolute tolerance on the complementarity. Successful termination requires that the max-norm of the (unscaled) complementarity is less than this threshold. The valid range for this real option is 0 &lt; compl_inf_tol and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_acceptable_tol"></a><a href="#OPT_acceptable_tol">&#x25B8;&nbsp;</a><b>acceptable_tol</b>: "Acceptable" convergence tolerance (relative). </p><blockquote class="doxtable">
<p>Determines which (scaled) overall optimality error is considered to be "acceptable". There are two levels of termination criteria. If the usual "desired" tolerances (see tol, dual_inf_tol etc) are satisfied at an iteration, the algorithm immediately terminates with a success message. On the other hand, if the algorithm encounters "acceptable_iter" many iterations in a row that are considered "acceptable", it will terminate before the desired convergence tolerance is met. This is useful in cases where the algorithm might not be able to achieve the "desired" level of accuracy. The valid range for this real option is 0 &lt; acceptable_tol and its default value is 10<sup>-06</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_acceptable_iter"></a><a href="#OPT_acceptable_iter">&#x25B8;&nbsp;</a><b>acceptable_iter</b>: Number of "acceptable" iterates before triggering termination. </p><blockquote class="doxtable">
<p>If the algorithm encounters this many successive "acceptable" iterates (see "acceptable_tol"), it terminates, assuming that the problem has been solved to best possible accuracy given round-off. If it is set to zero, this heuristic is disabled. The valid range for this integer option is 0 &le; acceptable_iter and its default value is 15. </p>
</blockquote>
<p><a class="anchor" id="OPT_acceptable_dual_inf_tol"></a><a href="#OPT_acceptable_dual_inf_tol">&#x25B8;&nbsp;</a><b>acceptable_dual_inf_tol</b>: "Acceptance" threshold for the dual infeasibility. </p><blockquote class="doxtable">
<p>Absolute tolerance on the dual infeasibility. "Acceptable" termination requires that the (max-norm of the unscaled) dual infeasibility is less than this threshold; see also acceptable_tol. The valid range for this real option is 0 &lt; acceptable_dual_inf_tol and its default value is 10<sup>+10</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_acceptable_constr_viol_tol"></a><a href="#OPT_acceptable_constr_viol_tol">&#x25B8;&nbsp;</a><b>acceptable_constr_viol_tol</b>: "Acceptance" threshold for the constraint violation. </p><blockquote class="doxtable">
<p>Absolute tolerance on the constraint violation. "Acceptable" termination requires that the max-norm of the (unscaled) constraint violation is less than this threshold; see also acceptable_tol. The valid range for this real option is 0 &lt; acceptable_constr_viol_tol and its default value is 0.01. </p>
</blockquote>
<p><a class="anchor" id="OPT_acceptable_compl_inf_tol"></a><a href="#OPT_acceptable_compl_inf_tol">&#x25B8;&nbsp;</a><b>acceptable_compl_inf_tol</b>: "Acceptance" threshold for the complementarity conditions. </p><blockquote class="doxtable">
<p>Absolute tolerance on the complementarity. "Acceptable" termination requires that the max-norm of the (unscaled) complementarity is less than this threshold; see also acceptable_tol. The valid range for this real option is 0 &lt; acceptable_compl_inf_tol and its default value is 0.01. </p>
</blockquote>
<p><a class="anchor" id="OPT_acceptable_obj_change_tol"></a><a href="#OPT_acceptable_obj_change_tol">&#x25B8;&nbsp;</a><b>acceptable_obj_change_tol</b>: "Acceptance" stopping criterion based on objective function change. </p><blockquote class="doxtable">
<p>If the relative change of the objective function (scaled by Max(1,|f(x)|)) is less than this value, this part of the acceptable tolerance termination is satisfied; see also acceptable_tol. This is useful for the quasi-Newton option, which has trouble to bring down the dual infeasibility. The valid range for this real option is 0 &le; acceptable_obj_change_tol and its default value is 10<sup>+20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_diverging_iterates_tol"></a><a href="#OPT_diverging_iterates_tol">&#x25B8;&nbsp;</a><b>diverging_iterates_tol</b>: Threshold for maximal value of primal iterates. </p><blockquote class="doxtable">
<p>If any component of the primal iterates exceeded this value (in absolute terms), the optimization is aborted with the exit message that the iterates seem to be diverging. The valid range for this real option is 0 &lt; diverging_iterates_tol and its default value is 10<sup>+20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_mu_target"></a><a href="#OPT_mu_target">&#x25B8;&nbsp;</a><b>mu_target</b>: Desired value of complementarity. </p><blockquote class="doxtable">
<p>Usually, the barrier parameter is driven to zero and the termination test for complementarity is measured with respect to zero complementarity. However, in some cases it might be desired to have <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> solve barrier problem for strictly positive value of the barrier parameter. In this case, the value of "mu_target" specifies the final value of the barrier parameter, and the termination tests are then defined with respect to the barrier problem for this value of the barrier parameter. The valid range for this real option is 0 &le; mu_target and its default value is 0. </p>
</blockquote>
<h2><a class="anchor" id="OPT_Output"></a>
Output</h2>
<p><a class="anchor" id="OPT_print_level"></a><a href="#OPT_print_level">&#x25B8;&nbsp;</a><b>print_level</b>: Output verbosity level. </p><blockquote class="doxtable">
<p>Sets the default verbosity level for console output. The larger this value the more detailed is the output. The valid range for this integer option is 0 &le; print_level &le; 12 and its default value is 5. </p>
</blockquote>
<p><a class="anchor" id="OPT_output_file"></a><a href="#OPT_output_file">&#x25B8;&nbsp;</a><b>output_file</b>: File name of desired output file (leave unset for no file output). </p><blockquote class="doxtable">
<p>NOTE: This option only works when read from the ipopt.opt options file! An output file with this name will be written (leave unset for no file output). The verbosity level is by default set to "print_level", but can be overridden with "file_print_level". The file name is changed to use only small letters. The default value for this string option is "".</p>
<p>Possible values:</p><ul>
<li>*: Any acceptable standard file name </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_file_print_level"></a><a href="#OPT_file_print_level">&#x25B8;&nbsp;</a><b>file_print_level</b>: Verbosity level for output file. </p><blockquote class="doxtable">
<p>NOTE: This option only works when read from the ipopt.opt options file! Determines the verbosity level for the file specified by "output_file". By default it is the same as "print_level". The valid range for this integer option is 0 &le; file_print_level &le; 12 and its default value is 5. </p>
</blockquote>
<p><a class="anchor" id="OPT_file_append"></a><a href="#OPT_file_append">&#x25B8;&nbsp;</a><b>file_append</b>: Whether to append to output file, if set, instead of truncating. </p><blockquote class="doxtable">
<p>NOTE: This option only works when read from the ipopt.opt options file! The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_print_user_options"></a><a href="#OPT_print_user_options">&#x25B8;&nbsp;</a><b>print_user_options</b>: Print all options set by the user. </p><blockquote class="doxtable">
<p>If selected, the algorithm will print the list of all options set by the user including their values and whether they have been used. In some cases this information might be incorrect, due to the internal program flow. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_print_options_documentation"></a><a href="#OPT_print_options_documentation">&#x25B8;&nbsp;</a><b>print_options_documentation</b>: Switch to print all algorithmic options with some documentation before solving the optimization problem. </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_print_timing_statistics"></a><a href="#OPT_print_timing_statistics">&#x25B8;&nbsp;</a><b>print_timing_statistics</b>: Switch to print timing statistics. </p><blockquote class="doxtable">
<p>If selected, the program will print the time spend for selected tasks. This implies timing_statistics=yes. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_print_options_mode"></a><a href="#OPT_print_options_mode">&#x25B8;&nbsp;</a><b>print_options_mode</b>: format in which to print options documentation </p><blockquote class="doxtable">
<p>The default value for this string option is "text".</p>
<p>Possible values:</p><ul>
<li>text: Ordinary text</li>
<li>latex: LaTeX formatted</li>
<li>doxygen: Doxygen (markdown) formatted </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_print_advanced_options"></a><a href="#OPT_print_advanced_options">&#x25B8;&nbsp;</a><b>print_advanced_options</b> (<em>advanced</em>): whether to print also advanced options </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_print_info_string"></a><a href="#OPT_print_info_string">&#x25B8;&nbsp;</a><b>print_info_string</b>: Enables printing of additional info string at end of iteration output. </p><blockquote class="doxtable">
<p>This string contains some insider information about the current iteration. For details, look for "Diagnostic Tags" in the <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> documentation. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_inf_pr_output"></a><a href="#OPT_inf_pr_output">&#x25B8;&nbsp;</a><b>inf_pr_output</b>: Determines what value is printed in the "inf_pr" output column. </p><blockquote class="doxtable">
<p><a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> works with a reformulation of the original problem, where slacks are introduced and the problem might have been scaled. The choice "internal" prints out the constraint violation of this formulation. With "original" the true constraint violation in the original NLP is printed. The default value for this string option is "original".</p>
<p>Possible values:</p><ul>
<li>internal: max-norm of violation of internal equality constraints</li>
<li>original: maximal constraint violation in original NLP </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_print_frequency_iter"></a><a href="#OPT_print_frequency_iter">&#x25B8;&nbsp;</a><b>print_frequency_iter</b>: Determines at which iteration frequency the summarizing iteration output line should be printed. </p><blockquote class="doxtable">
<p>Summarizing iteration output is printed every print_frequency_iter iterations, if at least print_frequency_time seconds have passed since last output. The valid range for this integer option is 1 &le; print_frequency_iter and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_print_frequency_time"></a><a href="#OPT_print_frequency_time">&#x25B8;&nbsp;</a><b>print_frequency_time</b>: Determines at which time frequency the summarizing iteration output line should be printed. </p><blockquote class="doxtable">
<p>Summarizing iteration output is printed if at least print_frequency_time seconds have passed since last output and the iteration number is a multiple of print_frequency_iter. The valid range for this real option is 0 &le; print_frequency_time and its default value is 0. </p>
</blockquote>
<h2><a class="anchor" id="OPT_NLP"></a>
NLP</h2>
<p><a class="anchor" id="OPT_nlp_lower_bound_inf"></a><a href="#OPT_nlp_lower_bound_inf">&#x25B8;&nbsp;</a><b>nlp_lower_bound_inf</b>: any bound less or equal this value will be considered -inf (i.e. not lower bounded). </p><blockquote class="doxtable">
<p>The valid range for this real option is unrestricted and its default value is -10<sup>+19</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_nlp_upper_bound_inf"></a><a href="#OPT_nlp_upper_bound_inf">&#x25B8;&nbsp;</a><b>nlp_upper_bound_inf</b>: any bound greater or this value will be considered +inf (i.e. not upper bounded). </p><blockquote class="doxtable">
<p>The valid range for this real option is unrestricted and its default value is 10<sup>+19</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_fixed_variable_treatment"></a><a href="#OPT_fixed_variable_treatment">&#x25B8;&nbsp;</a><b>fixed_variable_treatment</b>: Determines how fixed variables should be handled. </p><blockquote class="doxtable">
<p>The main difference between those options is that the starting point in the "make_constraint" case still has the fixed variables at their given values, whereas in the case "make_parameter(_nodual)" the functions are always evaluated with the fixed values for those variables. Also, for "relax_bounds", the fixing bound constraints are relaxed (according to" bound_relax_factor"). For all but "make_parameter_nodual", bound multipliers are computed for the fixed variables. The default value for this string option is "make_parameter".</p>
<p>Possible values:</p><ul>
<li>make_parameter: Remove fixed variable from optimization variables</li>
<li>make_parameter_nodual: Remove fixed variable from optimization variables and do not compute bound multipliers for fixed variables</li>
<li>make_constraint: Add equality constraints fixing variables</li>
<li>relax_bounds: Relax fixing bound constraints </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_dependency_detector"></a><a href="#OPT_dependency_detector">&#x25B8;&nbsp;</a><b>dependency_detector</b> (<em>advanced</em>): Indicates which linear solver should be used to detect linearly dependent equality constraints. </p><blockquote class="doxtable">
<p>This is experimental and does not work well. The default value for this string option is "none".</p>
<p>Possible values:</p><ul>
<li>none: don't check; no extra work at beginning</li>
<li>mumps: use MUMPS</li>
<li>wsmp: use WSMP</li>
<li>ma28: use MA28 </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_dependency_detection_with_rhs"></a><a href="#OPT_dependency_detection_with_rhs">&#x25B8;&nbsp;</a><b>dependency_detection_with_rhs</b> (<em>advanced</em>): Indicates if the right hand sides of the constraints should be considered in addition to gradients during dependency detection </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_num_linear_variables"></a><a href="#OPT_num_linear_variables">&#x25B8;&nbsp;</a><b>num_linear_variables</b> (<em>advanced</em>): Number of linear variables </p><blockquote class="doxtable">
<p>When the Hessian is approximated, it is assumed that the first num_linear_variables variables are linear. The Hessian is then not approximated in this space. If the get_number_of_nonlinear_variables method in the TNLP is implemented, this option is ignored. The valid range for this integer option is 0 &le; num_linear_variables and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_jacobian_approximation"></a><a href="#OPT_jacobian_approximation">&#x25B8;&nbsp;</a><b>jacobian_approximation</b> (<em>advanced</em>): Specifies technique to compute constraint Jacobian </p><blockquote class="doxtable">
<p>The default value for this string option is "exact".</p>
<p>Possible values:</p><ul>
<li>exact: user-provided derivatives</li>
<li>finite-difference-values: user-provided structure, values by finite differences </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_gradient_approximation"></a><a href="#OPT_gradient_approximation">&#x25B8;&nbsp;</a><b>gradient_approximation</b> (<em>advanced</em>): Specifies technique to compute objective Gradient </p><blockquote class="doxtable">
<p>The default value for this string option is "exact".</p>
<p>Possible values:</p><ul>
<li>exact: user-provided gradient</li>
<li>finite-difference-values: values by finite differences </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_findiff_perturbation"></a><a href="#OPT_findiff_perturbation">&#x25B8;&nbsp;</a><b>findiff_perturbation</b> (<em>advanced</em>): Size of the finite difference perturbation for derivative approximation. </p><blockquote class="doxtable">
<p>This determines the relative perturbation of the variable entries. The valid range for this real option is 0 &lt; findiff_perturbation and its default value is 10<sup>-07</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_kappa_d"></a><a href="#OPT_kappa_d">&#x25B8;&nbsp;</a><b>kappa_d</b> (<em>advanced</em>): Weight for linear damping term (to handle one-sided bounds). </p><blockquote class="doxtable">
<p>See Section 3.7 in implementation paper. The valid range for this real option is 0 &le; kappa_d and its default value is 10<sup>-05</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_bound_relax_factor"></a><a href="#OPT_bound_relax_factor">&#x25B8;&nbsp;</a><b>bound_relax_factor</b>: Factor for initial relaxation of the bounds. </p><blockquote class="doxtable">
<p>Before start of the optimization, the bounds given by the user are relaxed. This option sets the factor for this relaxation. Additional, the constraint violation tolerance constr_viol_tol is used to bound the relaxation by an absolute value. If it is set to zero, then then bounds relaxation is disabled. See Eqn.(35) in implementation paper. Note that the constraint violation reported by <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> at the end of the solution process does not include violations of the original (non-relaxed) variable bounds. See also option honor_original_bounds. The valid range for this real option is 0 &le; bound_relax_factor and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_honor_original_bounds"></a><a href="#OPT_honor_original_bounds">&#x25B8;&nbsp;</a><b>honor_original_bounds</b>: Indicates whether final points should be projected into original bounds. </p><blockquote class="doxtable">
<p><a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> might relax the bounds during the optimization (see, e.g., option "bound_relax_factor"). This option determines whether the final point should be projected back into the user-provide original bounds after the optimization. Note that violations of constraints and complementarity reported by <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> at the end of the solution process are for the non-projected point. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_check_derivatives_for_naninf"></a><a href="#OPT_check_derivatives_for_naninf">&#x25B8;&nbsp;</a><b>check_derivatives_for_naninf</b>: Indicates whether it is desired to check for Nan/Inf in derivative matrices </p><blockquote class="doxtable">
<p>Activating this option will cause an error if an invalid number is detected in the constraint Jacobians or the Lagrangian Hessian. If this is not activated, the test is skipped, and the algorithm might proceed with invalid numbers and fail. If test is activated and an invalid number is detected, the matrix is written to output with print_level corresponding to J_MOREDETAILED (7); so beware of large output! The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_grad_f_constant"></a><a href="#OPT_grad_f_constant">&#x25B8;&nbsp;</a><b>grad_f_constant</b>: Indicates whether to assume that the objective function is linear </p><blockquote class="doxtable">
<p>Activating this option will cause <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> to ask for the Gradient of the objective function only once from the NLP and reuse this information later. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_jac_c_constant"></a><a href="#OPT_jac_c_constant">&#x25B8;&nbsp;</a><b>jac_c_constant</b>: Indicates whether to assume that all equality constraints are linear </p><blockquote class="doxtable">
<p>Activating this option will cause <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> to ask for the Jacobian of the equality constraints only once from the NLP and reuse this information later. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_jac_d_constant"></a><a href="#OPT_jac_d_constant">&#x25B8;&nbsp;</a><b>jac_d_constant</b>: Indicates whether to assume that all inequality constraints are linear </p><blockquote class="doxtable">
<p>Activating this option will cause <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> to ask for the Jacobian of the inequality constraints only once from the NLP and reuse this information later. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_hessian_constant"></a><a href="#OPT_hessian_constant">&#x25B8;&nbsp;</a><b>hessian_constant</b>: Indicates whether to assume the problem is a QP (quadratic objective, linear constraints) </p><blockquote class="doxtable">
<p>Activating this option will cause <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> to ask for the Hessian of the Lagrangian function only once from the NLP and reuse this information later. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<h2><a class="anchor" id="OPT_NLP_Scaling"></a>
NLP Scaling</h2>
<p><a class="anchor" id="OPT_nlp_scaling_method"></a><a href="#OPT_nlp_scaling_method">&#x25B8;&nbsp;</a><b>nlp_scaling_method</b>: Select the technique used for scaling the NLP. </p><blockquote class="doxtable">
<p>Selects the technique used for scaling the problem internally before it is solved. For user-scaling, the parameters come from the NLP. If you are using AMPL, they can be specified through suffixes ("scaling_factor") The default value for this string option is "gradient-based".</p>
<p>Possible values:</p><ul>
<li>none: no problem scaling will be performed</li>
<li>user-scaling: scaling parameters will come from the user</li>
<li>gradient-based: scale the problem so the maximum gradient at the starting point is nlp_scaling_max_gradient</li>
<li>equilibration-based: scale the problem so that first derivatives are of order 1 at random points (uses Harwell routine MC19) </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_obj_scaling_factor"></a><a href="#OPT_obj_scaling_factor">&#x25B8;&nbsp;</a><b>obj_scaling_factor</b>: Scaling factor for the objective function. </p><blockquote class="doxtable">
<p>This option sets a scaling factor for the objective function. The scaling is seen internally by <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> but the unscaled objective is reported in the console output. If additional scaling parameters are computed (e.g. user-scaling or gradient-based), both factors are multiplied. If this value is chosen to be negative, <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> will maximize the objective function instead of minimizing it. The valid range for this real option is unrestricted and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_nlp_scaling_max_gradient"></a><a href="#OPT_nlp_scaling_max_gradient">&#x25B8;&nbsp;</a><b>nlp_scaling_max_gradient</b>: Maximum gradient after NLP scaling. </p><blockquote class="doxtable">
<p>This is the gradient scaling cut-off. If the maximum gradient is above this value, then gradient based scaling will be performed. Scaling parameters are calculated to scale the maximum gradient back to this value. (This is g_max in Section 3.8 of the implementation paper.) Note: This option is only used if "nlp_scaling_method" is chosen as "gradient-based". The valid range for this real option is 0 &lt; nlp_scaling_max_gradient and its default value is 100. </p>
</blockquote>
<p><a class="anchor" id="OPT_nlp_scaling_obj_target_gradient"></a><a href="#OPT_nlp_scaling_obj_target_gradient">&#x25B8;&nbsp;</a><b>nlp_scaling_obj_target_gradient</b> (<em>advanced</em>): Target value for objective function gradient size. </p><blockquote class="doxtable">
<p>If a positive number is chosen, the scaling factor for the objective function is computed so that the gradient has the max norm of the given size at the starting point. This overrides nlp_scaling_max_gradient for the objective function. The valid range for this real option is 0 &le; nlp_scaling_obj_target_gradient and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_nlp_scaling_constr_target_gradient"></a><a href="#OPT_nlp_scaling_constr_target_gradient">&#x25B8;&nbsp;</a><b>nlp_scaling_constr_target_gradient</b> (<em>advanced</em>): Target value for constraint function gradient size. </p><blockquote class="doxtable">
<p>If a positive number is chosen, the scaling factors for the constraint functions are computed so that the gradient has the max norm of the given size at the starting point. This overrides nlp_scaling_max_gradient for the constraint functions. The valid range for this real option is 0 &le; nlp_scaling_constr_target_gradient and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_nlp_scaling_min_value"></a><a href="#OPT_nlp_scaling_min_value">&#x25B8;&nbsp;</a><b>nlp_scaling_min_value</b>: Minimum value of gradient-based scaling values. </p><blockquote class="doxtable">
<p>This is the lower bound for the scaling factors computed by gradient-based scaling method. If some derivatives of some functions are huge, the scaling factors will otherwise become very small, and the (unscaled) final constraint violation, for example, might then be significant. Note: This option is only used if "nlp_scaling_method" is chosen as "gradient-based". The valid range for this real option is 0 &le; nlp_scaling_min_value and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<h2><a class="anchor" id="OPT_Initialization"></a>
Initialization</h2>
<p><a class="anchor" id="OPT_bound_push"></a><a href="#OPT_bound_push">&#x25B8;&nbsp;</a><b>bound_push</b>: Desired minimum absolute distance from the initial point to bound. </p><blockquote class="doxtable">
<p>Determines how much the initial point might have to be modified in order to be sufficiently inside the bounds (together with "bound_frac"). (This is kappa_1 in Section 3.6 of implementation paper.) The valid range for this real option is 0 &lt; bound_push and its default value is 0.01. </p>
</blockquote>
<p><a class="anchor" id="OPT_bound_frac"></a><a href="#OPT_bound_frac">&#x25B8;&nbsp;</a><b>bound_frac</b>: Desired minimum relative distance from the initial point to bound. </p><blockquote class="doxtable">
<p>Determines how much the initial point might have to be modified in order to be sufficiently inside the bounds (together with "bound_push"). (This is kappa_2 in Section 3.6 of implementation paper.) The valid range for this real option is 0 &lt; bound_frac &le; 0.5 and its default value is 0.01. </p>
</blockquote>
<p><a class="anchor" id="OPT_slack_bound_push"></a><a href="#OPT_slack_bound_push">&#x25B8;&nbsp;</a><b>slack_bound_push</b>: Desired minimum absolute distance from the initial slack to bound. </p><blockquote class="doxtable">
<p>Determines how much the initial slack variables might have to be modified in order to be sufficiently inside the inequality bounds (together with "slack_bound_frac"). (This is kappa_1 in Section 3.6 of implementation paper.) The valid range for this real option is 0 &lt; slack_bound_push and its default value is 0.01. </p>
</blockquote>
<p><a class="anchor" id="OPT_slack_bound_frac"></a><a href="#OPT_slack_bound_frac">&#x25B8;&nbsp;</a><b>slack_bound_frac</b>: Desired minimum relative distance from the initial slack to bound. </p><blockquote class="doxtable">
<p>Determines how much the initial slack variables might have to be modified in order to be sufficiently inside the inequality bounds (together with "slack_bound_push"). (This is kappa_2 in Section 3.6 of implementation paper.) The valid range for this real option is 0 &lt; slack_bound_frac &le; 0.5 and its default value is 0.01. </p>
</blockquote>
<p><a class="anchor" id="OPT_constr_mult_init_max"></a><a href="#OPT_constr_mult_init_max">&#x25B8;&nbsp;</a><b>constr_mult_init_max</b>: Maximum allowed least-square guess of constraint multipliers. </p><blockquote class="doxtable">
<p>Determines how large the initial least-square guesses of the constraint multipliers are allowed to be (in max-norm). If the guess is larger than this value, it is discarded and all constraint multipliers are set to zero. This options is also used when initializing the restoration phase. By default, "resto.constr_mult_init_max" (the one used in RestoIterateInitializer) is set to zero. The valid range for this real option is 0 &le; constr_mult_init_max and its default value is 1000. </p>
</blockquote>
<p><a class="anchor" id="OPT_bound_mult_init_val"></a><a href="#OPT_bound_mult_init_val">&#x25B8;&nbsp;</a><b>bound_mult_init_val</b>: Initial value for the bound multipliers. </p><blockquote class="doxtable">
<p>All dual variables corresponding to bound constraints are initialized to this value. The valid range for this real option is 0 &lt; bound_mult_init_val and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_bound_mult_init_method"></a><a href="#OPT_bound_mult_init_method">&#x25B8;&nbsp;</a><b>bound_mult_init_method</b>: Initialization method for bound multipliers </p><blockquote class="doxtable">
<p>This option defines how the iterates for the bound multipliers are initialized. If "constant" is chosen, then all bound multipliers are initialized to the value of "bound_mult_init_val". If "mu-based" is chosen, then each value is initialized to the the value of "mu_init" divided by the corresponding slack variable. This latter option might be useful if the starting point is close to the optimal solution. The default value for this string option is "constant".</p>
<p>Possible values:</p><ul>
<li>constant: set all bound multipliers to the value of bound_mult_init_val</li>
<li>mu-based: initialize to mu_init/x_slack </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_least_square_init_primal"></a><a href="#OPT_least_square_init_primal">&#x25B8;&nbsp;</a><b>least_square_init_primal</b>: Least square initialization of the primal variables </p><blockquote class="doxtable">
<p>If set to yes, <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> ignores the user provided point and solves a least square problem for the primal variables (x and s) to fit the linearized equality and inequality constraints.This might be useful if the user doesn't know anything about the starting point, or for solving an LP or QP. The default value for this string option is "no".</p>
<p>Possible values:</p><ul>
<li>no: take user-provided point</li>
<li>yes: overwrite user-provided point with least-square estimates </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_least_square_init_duals"></a><a href="#OPT_least_square_init_duals">&#x25B8;&nbsp;</a><b>least_square_init_duals</b>: Least square initialization of all dual variables </p><blockquote class="doxtable">
<p>If set to yes, <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> tries to compute least-square multipliers (considering ALL dual variables). If successful, the bound multipliers are possibly corrected to be at least bound_mult_init_val. This might be useful if the user doesn't know anything about the starting point, or for solving an LP or QP. This overwrites option "bound_mult_init_method". The default value for this string option is "no".</p>
<p>Possible values:</p><ul>
<li>no: use bound_mult_init_val and least-square equality constraint multipliers</li>
<li>yes: overwrite user-provided point with least-square estimates </li>
</ul>
</blockquote>
<h2><a class="anchor" id="OPT_Warm_Start"></a>
Warm Start</h2>
<p><a class="anchor" id="OPT_warm_start_init_point"></a><a href="#OPT_warm_start_init_point">&#x25B8;&nbsp;</a><b>warm_start_init_point</b>: Warm-start for initial point </p><blockquote class="doxtable">
<p>Indicates whether this optimization should use a warm start initialization, where values of primal and dual variables are given (e.g., from a previous optimization of a related problem.) The default value for this string option is "no".</p>
<p>Possible values:</p><ul>
<li>no: do not use the warm start initialization</li>
<li>yes: use the warm start initialization </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_warm_start_same_structure"></a><a href="#OPT_warm_start_same_structure">&#x25B8;&nbsp;</a><b>warm_start_same_structure</b> (<em>advanced</em>): Indicates whether a problem with a structure identical to the previous one is to be solved. </p><blockquote class="doxtable">
<p>If enabled, then the algorithm assumes that an NLP is now to be solved whose structure is identical to one that already was considered (with the same NLP object). The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_warm_start_bound_push"></a><a href="#OPT_warm_start_bound_push">&#x25B8;&nbsp;</a><b>warm_start_bound_push</b>: same as bound_push for the regular initializer </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; warm_start_bound_push and its default value is 0.001. </p>
</blockquote>
<p><a class="anchor" id="OPT_warm_start_bound_frac"></a><a href="#OPT_warm_start_bound_frac">&#x25B8;&nbsp;</a><b>warm_start_bound_frac</b>: same as bound_frac for the regular initializer </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; warm_start_bound_frac &le; 0.5 and its default value is 0.001. </p>
</blockquote>
<p><a class="anchor" id="OPT_warm_start_slack_bound_push"></a><a href="#OPT_warm_start_slack_bound_push">&#x25B8;&nbsp;</a><b>warm_start_slack_bound_push</b>: same as slack_bound_push for the regular initializer </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; warm_start_slack_bound_push and its default value is 0.001. </p>
</blockquote>
<p><a class="anchor" id="OPT_warm_start_slack_bound_frac"></a><a href="#OPT_warm_start_slack_bound_frac">&#x25B8;&nbsp;</a><b>warm_start_slack_bound_frac</b>: same as slack_bound_frac for the regular initializer </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; warm_start_slack_bound_frac &le; 0.5 and its default value is 0.001. </p>
</blockquote>
<p><a class="anchor" id="OPT_warm_start_mult_bound_push"></a><a href="#OPT_warm_start_mult_bound_push">&#x25B8;&nbsp;</a><b>warm_start_mult_bound_push</b>: same as mult_bound_push for the regular initializer </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; warm_start_mult_bound_push and its default value is 0.001. </p>
</blockquote>
<p><a class="anchor" id="OPT_warm_start_mult_init_max"></a><a href="#OPT_warm_start_mult_init_max">&#x25B8;&nbsp;</a><b>warm_start_mult_init_max</b>: Maximum initial value for the equality multipliers. </p><blockquote class="doxtable">
<p>The valid range for this real option is unrestricted and its default value is 10<sup>+06</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_warm_start_entire_iterate"></a><a href="#OPT_warm_start_entire_iterate">&#x25B8;&nbsp;</a><b>warm_start_entire_iterate</b> (<em>advanced</em>): Tells algorithm whether to use the GetWarmStartIterate method in the NLP. </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values:</p><ul>
<li>no: call GetStartingPoint in the NLP</li>
<li>yes: call GetWarmStartIterate in the NLP </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_warm_start_target_mu"></a><a href="#OPT_warm_start_target_mu">&#x25B8;&nbsp;</a><b>warm_start_target_mu</b> (<em>advanced</em>) </p><blockquote class="doxtable">
<p>Experimental! The valid range for this real option is unrestricted and its default value is 0. </p>
</blockquote>
<h2><a class="anchor" id="OPT_Miscellaneous"></a>
Miscellaneous</h2>
<p><a class="anchor" id="OPT_option_file_name"></a><a href="#OPT_option_file_name">&#x25B8;&nbsp;</a><b>option_file_name</b>: File name of options file. </p><blockquote class="doxtable">
<p>By default, the name of the <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> options file is "ipopt.opt" - or something else if specified in the IpoptApplication::Initialize call. If this option is set by SetStringValue BEFORE the options file is read, it specifies the name of the options file. It does not make any sense to specify this option within the options file. Setting this option to an empty string disables reading of an options file. The default value for this string option is "ipopt.opt".</p>
<p>Possible values:</p><ul>
<li>*: Any acceptable standard file name </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_replace_bounds"></a><a href="#OPT_replace_bounds">&#x25B8;&nbsp;</a><b>replace_bounds</b> (<em>advanced</em>): Whether all variable bounds should be replaced by inequality constraints </p><blockquote class="doxtable">
<p>This option must be set for the inexact algorithm. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_skip_finalize_solution_call"></a><a href="#OPT_skip_finalize_solution_call">&#x25B8;&nbsp;</a><b>skip_finalize_solution_call</b> (<em>advanced</em>): Whether a call to NLP::FinalizeSolution after optimization should be suppressed </p><blockquote class="doxtable">
<p>In some <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> applications, the user might want to call the FinalizeSolution method separately. Setting this option to "yes" will cause the IpoptApplication object to suppress the default call to that method. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_timing_statistics"></a><a href="#OPT_timing_statistics">&#x25B8;&nbsp;</a><b>timing_statistics</b>: Indicates whether to measure time spend in components of <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> and NLP evaluation </p><blockquote class="doxtable">
<p>The overall algorithm time is unaffected by this option. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<h2><a class="anchor" id="OPT_Barrier_Parameter_Update"></a>
Barrier Parameter Update</h2>
<p><a class="anchor" id="OPT_mu_max_fact"></a><a href="#OPT_mu_max_fact">&#x25B8;&nbsp;</a><b>mu_max_fact</b>: Factor for initialization of maximum value for barrier parameter. </p><blockquote class="doxtable">
<p>This option determines the upper bound on the barrier parameter. This upper bound is computed as the average complementarity at the initial point times the value of this option. (Only used if option "mu_strategy" is chosen as "adaptive".) The valid range for this real option is 0 &lt; mu_max_fact and its default value is 1000. </p>
</blockquote>
<p><a class="anchor" id="OPT_mu_max"></a><a href="#OPT_mu_max">&#x25B8;&nbsp;</a><b>mu_max</b>: Maximum value for barrier parameter. </p><blockquote class="doxtable">
<p>This option specifies an upper bound on the barrier parameter in the adaptive mu selection mode. If this option is set, it overwrites the effect of mu_max_fact. (Only used if option "mu_strategy" is chosen as "adaptive".) The valid range for this real option is 0 &lt; mu_max and its default value is 100000. </p>
</blockquote>
<p><a class="anchor" id="OPT_mu_min"></a><a href="#OPT_mu_min">&#x25B8;&nbsp;</a><b>mu_min</b>: Minimum value for barrier parameter. </p><blockquote class="doxtable">
<p>This option specifies the lower bound on the barrier parameter in the adaptive mu selection mode. By default, it is set to the minimum of 1e-11 and min("tol","compl_inf_tol")/("barrier_tol_factor"+1), which should be a reasonable value. (Only used if option "mu_strategy" is chosen as "adaptive".) The valid range for this real option is 0 &lt; mu_min and its default value is 10<sup>-11</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_adaptive_mu_globalization"></a><a href="#OPT_adaptive_mu_globalization">&#x25B8;&nbsp;</a><b>adaptive_mu_globalization</b>: Globalization strategy for the adaptive mu selection mode. </p><blockquote class="doxtable">
<p>To achieve global convergence of the adaptive version, the algorithm has to switch to the monotone mode (Fiacco-McCormick approach) when convergence does not seem to appear. This option sets the criterion used to decide when to do this switch. (Only used if option "mu_strategy" is chosen as "adaptive".) The default value for this string option is "obj-constr-filter".</p>
<p>Possible values:</p><ul>
<li>kkt-error: nonmonotone decrease of kkt-error</li>
<li>obj-constr-filter: 2-dim filter for objective and constraint violation</li>
<li>never-monotone-mode: disables globalization </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_adaptive_mu_kkterror_red_iters"></a><a href="#OPT_adaptive_mu_kkterror_red_iters">&#x25B8;&nbsp;</a><b>adaptive_mu_kkterror_red_iters</b> (<em>advanced</em>): Maximum number of iterations requiring sufficient progress. </p><blockquote class="doxtable">
<p>For the "kkt-error" based globalization strategy, sufficient progress must be made for "adaptive_mu_kkterror_red_iters" iterations. If this number of iterations is exceeded, the globalization strategy switches to the monotone mode. The valid range for this integer option is 0 &le; adaptive_mu_kkterror_red_iters and its default value is 4. </p>
</blockquote>
<p><a class="anchor" id="OPT_adaptive_mu_kkterror_red_fact"></a><a href="#OPT_adaptive_mu_kkterror_red_fact">&#x25B8;&nbsp;</a><b>adaptive_mu_kkterror_red_fact</b> (<em>advanced</em>): Sufficient decrease factor for "kkt-error" globalization strategy. </p><blockquote class="doxtable">
<p>For the "kkt-error" based globalization strategy, the error must decrease by this factor to be deemed sufficient decrease. The valid range for this real option is 0 &lt; adaptive_mu_kkterror_red_fact &lt; 1 and its default value is 0.9999. </p>
</blockquote>
<p><a class="anchor" id="OPT_filter_margin_fact"></a><a href="#OPT_filter_margin_fact">&#x25B8;&nbsp;</a><b>filter_margin_fact</b> (<em>advanced</em>): Factor determining width of margin for obj-constr-filter adaptive globalization strategy. </p><blockquote class="doxtable">
<p>When using the adaptive globalization strategy, "obj-constr-filter", sufficient progress for a filter entry is defined as follows: (new obj) &lt; (filter obj) - filter_margin_fact*(new constr-viol) OR (new constr-viol) &lt; (filter constr-viol) - filter_margin_fact*(new constr-viol). For the description of the "kkt-error-filter" option see "filter_max_margin". The valid range for this real option is 0 &lt; filter_margin_fact &lt; 1 and its default value is 10<sup>-05</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_filter_max_margin"></a><a href="#OPT_filter_max_margin">&#x25B8;&nbsp;</a><b>filter_max_margin</b> (<em>advanced</em>): Maximum width of margin in obj-constr-filter adaptive globalization strategy. </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; filter_max_margin and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_adaptive_mu_restore_previous_iterate"></a><a href="#OPT_adaptive_mu_restore_previous_iterate">&#x25B8;&nbsp;</a><b>adaptive_mu_restore_previous_iterate</b> (<em>advanced</em>): Indicates if the previous accepted iterate should be restored if the monotone mode is entered. </p><blockquote class="doxtable">
<p>When the globalization strategy for the adaptive barrier algorithm switches to the monotone mode, it can either start from the most recent iterate (no), or from the last iterate that was accepted (yes). The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_adaptive_mu_monotone_init_factor"></a><a href="#OPT_adaptive_mu_monotone_init_factor">&#x25B8;&nbsp;</a><b>adaptive_mu_monotone_init_factor</b> (<em>advanced</em>): Determines the initial value of the barrier parameter when switching to the monotone mode. </p><blockquote class="doxtable">
<p>When the globalization strategy for the adaptive barrier algorithm switches to the monotone mode and fixed_mu_oracle is chosen as "average_compl", the barrier parameter is set to the current average complementarity times the value of "adaptive_mu_monotone_init_factor". The valid range for this real option is 0 &lt; adaptive_mu_monotone_init_factor and its default value is 0.8. </p>
</blockquote>
<p><a class="anchor" id="OPT_adaptive_mu_kkt_norm_type"></a><a href="#OPT_adaptive_mu_kkt_norm_type">&#x25B8;&nbsp;</a><b>adaptive_mu_kkt_norm_type</b> (<em>advanced</em>): Norm used for the KKT error in the adaptive mu globalization strategies. </p><blockquote class="doxtable">
<p>When computing the KKT error for the globalization strategies, the norm to be used is specified with this option. Note, this option is also used in the QualityFunctionMuOracle. The default value for this string option is "2-norm-squared".</p>
<p>Possible values:</p><ul>
<li>1-norm: use the 1-norm (abs sum)</li>
<li>2-norm-squared: use the 2-norm squared (sum of squares)</li>
<li>max-norm: use the infinity norm (max)</li>
<li>2-norm: use 2-norm </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_mu_strategy"></a><a href="#OPT_mu_strategy">&#x25B8;&nbsp;</a><b>mu_strategy</b>: Update strategy for barrier parameter. </p><blockquote class="doxtable">
<p>Determines which barrier parameter update strategy is to be used. The default value for this string option is "monotone".</p>
<p>Possible values:</p><ul>
<li>monotone: use the monotone (Fiacco-McCormick) strategy</li>
<li>adaptive: use the adaptive update strategy </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_mu_oracle"></a><a href="#OPT_mu_oracle">&#x25B8;&nbsp;</a><b>mu_oracle</b>: Oracle for a new barrier parameter in the adaptive strategy. </p><blockquote class="doxtable">
<p>Determines how a new barrier parameter is computed in each "free-mode" iteration of the adaptive barrier parameter strategy. (Only considered if "adaptive" is selected for option "mu_strategy"). The default value for this string option is "quality-function".</p>
<p>Possible values:</p><ul>
<li>probing: Mehrotra's probing heuristic</li>
<li>loqo: LOQO's centrality rule</li>
<li>quality-function: minimize a quality function </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_fixed_mu_oracle"></a><a href="#OPT_fixed_mu_oracle">&#x25B8;&nbsp;</a><b>fixed_mu_oracle</b>: Oracle for the barrier parameter when switching to fixed mode. </p><blockquote class="doxtable">
<p>Determines how the first value of the barrier parameter should be computed when switching to the "monotone mode" in the adaptive strategy. (Only considered if "adaptive" is selected for option "mu_strategy".) The default value for this string option is "average_compl".</p>
<p>Possible values:</p><ul>
<li>probing: Mehrotra's probing heuristic</li>
<li>loqo: LOQO's centrality rule</li>
<li>quality-function: minimize a quality function</li>
<li>average_compl: base on current average complementarity </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_mu_init"></a><a href="#OPT_mu_init">&#x25B8;&nbsp;</a><b>mu_init</b>: Initial value for the barrier parameter. </p><blockquote class="doxtable">
<p>This option determines the initial value for the barrier parameter (mu). It is only relevant in the monotone, Fiacco-McCormick version of the algorithm. (i.e., if "mu_strategy" is chosen as "monotone") The valid range for this real option is 0 &lt; mu_init and its default value is 0.1. </p>
</blockquote>
<p><a class="anchor" id="OPT_barrier_tol_factor"></a><a href="#OPT_barrier_tol_factor">&#x25B8;&nbsp;</a><b>barrier_tol_factor</b>: Factor for mu in barrier stop test. </p><blockquote class="doxtable">
<p>The convergence tolerance for each barrier problem in the monotone mode is the value of the barrier parameter times "barrier_tol_factor". This option is also used in the adaptive mu strategy during the monotone mode. This is kappa_epsilon in implementation paper. The valid range for this real option is 0 &lt; barrier_tol_factor and its default value is 10. </p>
</blockquote>
<p><a class="anchor" id="OPT_mu_linear_decrease_factor"></a><a href="#OPT_mu_linear_decrease_factor">&#x25B8;&nbsp;</a><b>mu_linear_decrease_factor</b>: Determines linear decrease rate of barrier parameter. </p><blockquote class="doxtable">
<p>For the Fiacco-McCormick update procedure the new barrier parameter mu is obtained by taking the minimum of mu*"mu_linear_decrease_factor" and mu^"superlinear_decrease_power". This is kappa_mu in implementation paper. This option is also used in the adaptive mu strategy during the monotone mode. The valid range for this real option is 0 &lt; mu_linear_decrease_factor &lt; 1 and its default value is 0.2. </p>
</blockquote>
<p><a class="anchor" id="OPT_mu_superlinear_decrease_power"></a><a href="#OPT_mu_superlinear_decrease_power">&#x25B8;&nbsp;</a><b>mu_superlinear_decrease_power</b>: Determines superlinear decrease rate of barrier parameter. </p><blockquote class="doxtable">
<p>For the Fiacco-McCormick update procedure the new barrier parameter mu is obtained by taking the minimum of mu*"mu_linear_decrease_factor" and mu^"superlinear_decrease_power". This is theta_mu in implementation paper. This option is also used in the adaptive mu strategy during the monotone mode. The valid range for this real option is 1 &lt; mu_superlinear_decrease_power &lt; 2 and its default value is 1.5. </p>
</blockquote>
<p><a class="anchor" id="OPT_mu_allow_fast_monotone_decrease"></a><a href="#OPT_mu_allow_fast_monotone_decrease">&#x25B8;&nbsp;</a><b>mu_allow_fast_monotone_decrease</b> (<em>advanced</em>): Allow skipping of barrier problem if barrier test is already met. </p><blockquote class="doxtable">
<p>The default value for this string option is "yes".</p>
<p>Possible values:</p><ul>
<li>no: Take at least one iteration per barrier problem even if the barrier test is already met for the updated barrier parameter</li>
<li>yes: Allow fast decrease of mu if barrier test it met </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_tau_min"></a><a href="#OPT_tau_min">&#x25B8;&nbsp;</a><b>tau_min</b> (<em>advanced</em>): Lower bound on fraction-to-the-boundary parameter tau. </p><blockquote class="doxtable">
<p>This is tau_min in the implementation paper. This option is also used in the adaptive mu strategy during the monotone mode. The valid range for this real option is 0 &lt; tau_min &lt; 1 and its default value is 0.99. </p>
</blockquote>
<p><a class="anchor" id="OPT_sigma_max"></a><a href="#OPT_sigma_max">&#x25B8;&nbsp;</a><b>sigma_max</b> (<em>advanced</em>): Maximum value of the centering parameter. </p><blockquote class="doxtable">
<p>This is the upper bound for the centering parameter chosen by the quality function based barrier parameter update. Only used if option "mu_oracle" is set to "quality-function". The valid range for this real option is 0 &lt; sigma_max and its default value is 100. </p>
</blockquote>
<p><a class="anchor" id="OPT_sigma_min"></a><a href="#OPT_sigma_min">&#x25B8;&nbsp;</a><b>sigma_min</b> (<em>advanced</em>): Minimum value of the centering parameter. </p><blockquote class="doxtable">
<p>This is the lower bound for the centering parameter chosen by the quality function based barrier parameter update. Only used if option "mu_oracle" is set to "quality-function". The valid range for this real option is 0 &le; sigma_min and its default value is 10<sup>-06</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_quality_function_norm_type"></a><a href="#OPT_quality_function_norm_type">&#x25B8;&nbsp;</a><b>quality_function_norm_type</b> (<em>advanced</em>): Norm used for components of the quality function. </p><blockquote class="doxtable">
<p>Only used if option "mu_oracle" is set to "quality-function". The default value for this string option is "2-norm-squared".</p>
<p>Possible values:</p><ul>
<li>1-norm: use the 1-norm (abs sum)</li>
<li>2-norm-squared: use the 2-norm squared (sum of squares)</li>
<li>max-norm: use the infinity norm (max)</li>
<li>2-norm: use 2-norm </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_quality_function_centrality"></a><a href="#OPT_quality_function_centrality">&#x25B8;&nbsp;</a><b>quality_function_centrality</b> (<em>advanced</em>): The penalty term for centrality that is included in quality function. </p><blockquote class="doxtable">
<p>This determines whether a term is added to the quality function to penalize deviation from centrality with respect to complementarity. The complementarity measure here is the xi in the Loqo update rule. Only used if option "mu_oracle" is set to "quality-function". The default value for this string option is "none".</p>
<p>Possible values:</p><ul>
<li>none: no penalty term is added</li>
<li>log: complementarity * the log of the centrality measure</li>
<li>reciprocal: complementarity * the reciprocal of the centrality measure</li>
<li>cubed-reciprocal: complementarity * the reciprocal of the centrality measure cubed </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_quality_function_balancing_term"></a><a href="#OPT_quality_function_balancing_term">&#x25B8;&nbsp;</a><b>quality_function_balancing_term</b> (<em>advanced</em>): The balancing term included in the quality function for centrality. </p><blockquote class="doxtable">
<p>This determines whether a term is added to the quality function that penalizes situations where the complementarity is much smaller than dual and primal infeasibilities. Only used if option "mu_oracle" is set to "quality-function". The default value for this string option is "none".</p>
<p>Possible values:</p><ul>
<li>none: no balancing term is added</li>
<li>cubic: Max(0,Max(dual_inf,primal_inf)-compl)^3 </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_quality_function_max_section_steps"></a><a href="#OPT_quality_function_max_section_steps">&#x25B8;&nbsp;</a><b>quality_function_max_section_steps</b>: Maximum number of search steps during direct search procedure determining the optimal centering parameter. </p><blockquote class="doxtable">
<p>The golden section search is performed for the quality function based mu oracle. Only used if option "mu_oracle" is set to "quality-function". The valid range for this integer option is 0 &le; quality_function_max_section_steps and its default value is 8. </p>
</blockquote>
<p><a class="anchor" id="OPT_quality_function_section_sigma_tol"></a><a href="#OPT_quality_function_section_sigma_tol">&#x25B8;&nbsp;</a><b>quality_function_section_sigma_tol</b> (<em>advanced</em>): Tolerance for the section search procedure determining the optimal centering parameter (in sigma space). </p><blockquote class="doxtable">
<p>The golden section search is performed for the quality function based mu oracle. Only used if option "mu_oracle" is set to "quality-function". The valid range for this real option is 0 &le; quality_function_section_sigma_tol &lt; 1 and its default value is 0.01. </p>
</blockquote>
<p><a class="anchor" id="OPT_quality_function_section_qf_tol"></a><a href="#OPT_quality_function_section_qf_tol">&#x25B8;&nbsp;</a><b>quality_function_section_qf_tol</b> (<em>advanced</em>): Tolerance for the golden section search procedure determining the optimal centering parameter (in the function value space). </p><blockquote class="doxtable">
<p>The golden section search is performed for the quality function based mu oracle. Only used if option "mu_oracle" is set to "quality-function". The valid range for this real option is 0 &le; quality_function_section_qf_tol &lt; 1 and its default value is 0. </p>
</blockquote>
<h2><a class="anchor" id="OPT_Line_Search"></a>
Line Search</h2>
<p><a class="anchor" id="OPT_line_search_method"></a><a href="#OPT_line_search_method">&#x25B8;&nbsp;</a><b>line_search_method</b> (<em>advanced</em>): Globalization method used in backtracking line search </p><blockquote class="doxtable">
<p>Only the "filter" choice is officially supported. But sometimes, good results might be obtained with the other choices. The default value for this string option is "filter".</p>
<p>Possible values:</p><ul>
<li>filter: Filter method</li>
<li>cg-penalty: Chen-Goldfarb penalty function</li>
<li>penalty: Standard penalty function </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_alpha_red_factor"></a><a href="#OPT_alpha_red_factor">&#x25B8;&nbsp;</a><b>alpha_red_factor</b> (<em>advanced</em>): Fractional reduction of the trial step size in the backtracking line search. </p><blockquote class="doxtable">
<p>At every step of the backtracking line search, the trial step size is reduced by this factor. The valid range for this real option is 0 &lt; alpha_red_factor &lt; 1 and its default value is 0.5. </p>
</blockquote>
<p><a class="anchor" id="OPT_accept_every_trial_step"></a><a href="#OPT_accept_every_trial_step">&#x25B8;&nbsp;</a><b>accept_every_trial_step</b>: Always accept the first trial step. </p><blockquote class="doxtable">
<p>Setting this option to "yes" essentially disables the line search and makes the algorithm take aggressive steps, without global convergence guarantees. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_accept_after_max_steps"></a><a href="#OPT_accept_after_max_steps">&#x25B8;&nbsp;</a><b>accept_after_max_steps</b> (<em>advanced</em>): Accept a trial point after maximal this number of steps even if it does not satisfy line search conditions. </p><blockquote class="doxtable">
<p>Setting this to -1 disables this option. The valid range for this integer option is -1 &le; accept_after_max_steps and its default value is -1. </p>
</blockquote>
<p><a class="anchor" id="OPT_alpha_for_y"></a><a href="#OPT_alpha_for_y">&#x25B8;&nbsp;</a><b>alpha_for_y</b>: Method to determine the step size for constraint multipliers (alpha_y) . </p><blockquote class="doxtable">
<p>The default value for this string option is "primal".</p>
<p>Possible values:</p><ul>
<li>primal: use primal step size</li>
<li>bound-mult: use step size for the bound multipliers (good for LPs)</li>
<li>min: use the min of primal and bound multipliers</li>
<li>max: use the max of primal and bound multipliers</li>
<li>full: take a full step of size one</li>
<li>min-dual-infeas: choose step size minimizing new dual infeasibility</li>
<li>safer-min-dual-infeas: like "min_dual_infeas", but safeguarded by "min" and "max"</li>
<li>primal-and-full: use the primal step size, and full step if delta_x &lt;= alpha_for_y_tol</li>
<li>dual-and-full: use the dual step size, and full step if delta_x &lt;= alpha_for_y_tol</li>
<li>acceptor: Call LSAcceptor to get step size for y </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_alpha_for_y_tol"></a><a href="#OPT_alpha_for_y_tol">&#x25B8;&nbsp;</a><b>alpha_for_y_tol</b>: Tolerance for switching to full equality multiplier steps. </p><blockquote class="doxtable">
<p>This is only relevant if "alpha_for_y" is chosen "primal-and-full" or "dual-and-full". The step size for the equality constraint multipliers is taken to be one if the max-norm of the primal step is less than this tolerance. The valid range for this real option is 0 &le; alpha_for_y_tol and its default value is 10. </p>
</blockquote>
<p><a class="anchor" id="OPT_tiny_step_tol"></a><a href="#OPT_tiny_step_tol">&#x25B8;&nbsp;</a><b>tiny_step_tol</b> (<em>advanced</em>): Tolerance for detecting numerically insignificant steps. </p><blockquote class="doxtable">
<p>If the search direction in the primal variables (x and s) is, in relative terms for each component, less than this value, the algorithm accepts the full step without line search. If this happens repeatedly, the algorithm will terminate with a corresponding exit message. The default value is 10 times machine precision. The valid range for this real option is 0 &le; tiny_step_tol and its default value is 2.22045 &middot; 10<sup>-15</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_tiny_step_y_tol"></a><a href="#OPT_tiny_step_y_tol">&#x25B8;&nbsp;</a><b>tiny_step_y_tol</b> (<em>advanced</em>): Tolerance for quitting because of numerically insignificant steps. </p><blockquote class="doxtable">
<p>If the search direction in the primal variables (x and s) is, in relative terms for each component, repeatedly less than tiny_step_tol, and the step in the y variables is smaller than this threshold, the algorithm will terminate. The valid range for this real option is 0 &le; tiny_step_y_tol and its default value is 0.01. </p>
</blockquote>
<p><a class="anchor" id="OPT_watchdog_shortened_iter_trigger"></a><a href="#OPT_watchdog_shortened_iter_trigger">&#x25B8;&nbsp;</a><b>watchdog_shortened_iter_trigger</b>: Number of shortened iterations that trigger the watchdog. </p><blockquote class="doxtable">
<p>If the number of successive iterations in which the backtracking line search did not accept the first trial point exceeds this number, the watchdog procedure is activated. Choosing "0" here disables the watchdog procedure. The valid range for this integer option is 0 &le; watchdog_shortened_iter_trigger and its default value is 10. </p>
</blockquote>
<p><a class="anchor" id="OPT_watchdog_trial_iter_max"></a><a href="#OPT_watchdog_trial_iter_max">&#x25B8;&nbsp;</a><b>watchdog_trial_iter_max</b>: Maximum number of watchdog iterations. </p><blockquote class="doxtable">
<p>This option determines the number of trial iterations allowed before the watchdog procedure is aborted and the algorithm returns to the stored point. The valid range for this integer option is 1 &le; watchdog_trial_iter_max and its default value is 3. </p>
</blockquote>
<p><a class="anchor" id="OPT_theta_max_fact"></a><a href="#OPT_theta_max_fact">&#x25B8;&nbsp;</a><b>theta_max_fact</b> (<em>advanced</em>): Determines upper bound for constraint violation in the filter. </p><blockquote class="doxtable">
<p>The algorithmic parameter theta_max is determined as theta_max_fact times the maximum of 1 and the constraint violation at initial point. Any point with a constraint violation larger than theta_max is unacceptable to the filter (see Eqn. (21) in the implementation paper). The valid range for this real option is 0 &lt; theta_max_fact and its default value is 10000. </p>
</blockquote>
<p><a class="anchor" id="OPT_theta_min_fact"></a><a href="#OPT_theta_min_fact">&#x25B8;&nbsp;</a><b>theta_min_fact</b> (<em>advanced</em>): Determines constraint violation threshold in the switching rule. </p><blockquote class="doxtable">
<p>The algorithmic parameter theta_min is determined as theta_min_fact times the maximum of 1 and the constraint violation at initial point. The switching rule treats an iteration as an h-type iteration whenever the current constraint violation is larger than theta_min (see paragraph before Eqn. (19) in the implementation paper). The valid range for this real option is 0 &lt; theta_min_fact and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_eta_phi"></a><a href="#OPT_eta_phi">&#x25B8;&nbsp;</a><b>eta_phi</b> (<em>advanced</em>): Relaxation factor in the Armijo condition. </p><blockquote class="doxtable">
<p>See Eqn. (20) in the implementation paper. The valid range for this real option is 0 &lt; eta_phi &lt; 0.5 and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_delta"></a><a href="#OPT_delta">&#x25B8;&nbsp;</a><b>delta</b> (<em>advanced</em>): Multiplier for constraint violation in the switching rule. </p><blockquote class="doxtable">
<p>See Eqn. (19) in the implementation paper. The valid range for this real option is 0 &lt; delta and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_s_phi"></a><a href="#OPT_s_phi">&#x25B8;&nbsp;</a><b>s_phi</b> (<em>advanced</em>): Exponent for linear barrier function model in the switching rule. </p><blockquote class="doxtable">
<p>See Eqn. (19) in the implementation paper. The valid range for this real option is 1 &lt; s_phi and its default value is 2.3. </p>
</blockquote>
<p><a class="anchor" id="OPT_s_theta"></a><a href="#OPT_s_theta">&#x25B8;&nbsp;</a><b>s_theta</b> (<em>advanced</em>): Exponent for current constraint violation in the switching rule. </p><blockquote class="doxtable">
<p>See Eqn. (19) in the implementation paper. The valid range for this real option is 1 &lt; s_theta and its default value is 1.1. </p>
</blockquote>
<p><a class="anchor" id="OPT_gamma_phi"></a><a href="#OPT_gamma_phi">&#x25B8;&nbsp;</a><b>gamma_phi</b> (<em>advanced</em>): Relaxation factor in the filter margin for the barrier function. </p><blockquote class="doxtable">
<p>See Eqn. (18a) in the implementation paper. The valid range for this real option is 0 &lt; gamma_phi &lt; 1 and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_gamma_theta"></a><a href="#OPT_gamma_theta">&#x25B8;&nbsp;</a><b>gamma_theta</b> (<em>advanced</em>): Relaxation factor in the filter margin for the constraint violation. </p><blockquote class="doxtable">
<p>See Eqn. (18b) in the implementation paper. The valid range for this real option is 0 &lt; gamma_theta &lt; 1 and its default value is 10<sup>-05</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_alpha_min_frac"></a><a href="#OPT_alpha_min_frac">&#x25B8;&nbsp;</a><b>alpha_min_frac</b> (<em>advanced</em>): Safety factor for the minimal step size (before switching to restoration phase). </p><blockquote class="doxtable">
<p>This is gamma_alpha in Eqn. (23) in the implementation paper. The valid range for this real option is 0 &lt; alpha_min_frac &lt; 1 and its default value is 0.05. </p>
</blockquote>
<p><a class="anchor" id="OPT_max_soc"></a><a href="#OPT_max_soc">&#x25B8;&nbsp;</a><b>max_soc</b>: Maximum number of second order correction trial steps at each iteration. </p><blockquote class="doxtable">
<p>Choosing 0 disables the second order corrections. This is p^{max} of Step A-5.9 of Algorithm A in the implementation paper. The valid range for this integer option is 0 &le; max_soc and its default value is 4. </p>
</blockquote>
<p><a class="anchor" id="OPT_kappa_soc"></a><a href="#OPT_kappa_soc">&#x25B8;&nbsp;</a><b>kappa_soc</b> (<em>advanced</em>): Factor in the sufficient reduction rule for second order correction. </p><blockquote class="doxtable">
<p>This option determines how much a second order correction step must reduce the constraint violation so that further correction steps are attempted. See Step A-5.9 of Algorithm A in the implementation paper. The valid range for this real option is 0 &lt; kappa_soc and its default value is 0.99. </p>
</blockquote>
<p><a class="anchor" id="OPT_obj_max_inc"></a><a href="#OPT_obj_max_inc">&#x25B8;&nbsp;</a><b>obj_max_inc</b> (<em>advanced</em>): Determines the upper bound on the acceptable increase of barrier objective function. </p><blockquote class="doxtable">
<p>Trial points are rejected if they lead to an increase in the barrier objective function by more than obj_max_inc orders of magnitude. The valid range for this real option is 1 &lt; obj_max_inc and its default value is 5. </p>
</blockquote>
<p><a class="anchor" id="OPT_max_filter_resets"></a><a href="#OPT_max_filter_resets">&#x25B8;&nbsp;</a><b>max_filter_resets</b> (<em>advanced</em>): Maximal allowed number of filter resets </p><blockquote class="doxtable">
<p>A positive number enables a heuristic that resets the filter, whenever in more than "filter_reset_trigger" successive iterations the last rejected trial steps size was rejected because of the filter. This option determine the maximal number of resets that are allowed to take place. The valid range for this integer option is 0 &le; max_filter_resets and its default value is 5. </p>
</blockquote>
<p><a class="anchor" id="OPT_filter_reset_trigger"></a><a href="#OPT_filter_reset_trigger">&#x25B8;&nbsp;</a><b>filter_reset_trigger</b> (<em>advanced</em>): Number of iterations that trigger the filter reset. </p><blockquote class="doxtable">
<p>If the filter reset heuristic is active and the number of successive iterations in which the last rejected trial step size was rejected because of the filter, the filter is reset. The valid range for this integer option is 1 &le; filter_reset_trigger and its default value is 5. </p>
</blockquote>
<p><a class="anchor" id="OPT_corrector_type"></a><a href="#OPT_corrector_type">&#x25B8;&nbsp;</a><b>corrector_type</b> (<em>advanced</em>): The type of corrector steps that should be taken. </p><blockquote class="doxtable">
<p>If "mu_strategy" is "adaptive", this option determines what kind of corrector steps should be tried. Changing this option is experimental. The default value for this string option is "none".</p>
<p>Possible values:</p><ul>
<li>none: no corrector</li>
<li>affine: corrector step towards mu=0</li>
<li>primal-dual: corrector step towards current mu </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_skip_corr_if_neg_curv"></a><a href="#OPT_skip_corr_if_neg_curv">&#x25B8;&nbsp;</a><b>skip_corr_if_neg_curv</b> (<em>advanced</em>): Whether to skip the corrector step in negative curvature iteration. </p><blockquote class="doxtable">
<p>The corrector step is not tried if negative curvature has been encountered during the computation of the search direction in the current iteration. This option is only used if "mu_strategy" is "adaptive". Changing this option is experimental. The default value for this string option is "yes".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_skip_corr_in_monotone_mode"></a><a href="#OPT_skip_corr_in_monotone_mode">&#x25B8;&nbsp;</a><b>skip_corr_in_monotone_mode</b> (<em>advanced</em>): Whether to skip the corrector step during monotone barrier parameter mode. </p><blockquote class="doxtable">
<p>The corrector step is not tried if the algorithm is currently in the monotone mode (see also option "barrier_strategy"). This option is only used if "mu_strategy" is "adaptive". Changing this option is experimental. The default value for this string option is "yes".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_corrector_compl_avrg_red_fact"></a><a href="#OPT_corrector_compl_avrg_red_fact">&#x25B8;&nbsp;</a><b>corrector_compl_avrg_red_fact</b> (<em>advanced</em>): Complementarity tolerance factor for accepting corrector step. </p><blockquote class="doxtable">
<p>This option determines the factor by which complementarity is allowed to increase for a corrector step to be accepted. Changing this option is experimental. The valid range for this real option is 0 &lt; corrector_compl_avrg_red_fact and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_soc_method"></a><a href="#OPT_soc_method">&#x25B8;&nbsp;</a><b>soc_method</b>: Ways to apply second order correction </p><blockquote class="doxtable">
<p>This option determines the way to apply second order correction, 0 is the method described in the implementation paper. 1 is the modified way which adds alpha on the rhs of x and s rows. The valid range for this integer option is 0 &le; soc_method &le; 1 and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_nu_init"></a><a href="#OPT_nu_init">&#x25B8;&nbsp;</a><b>nu_init</b> (<em>advanced</em>): Initial value of the penalty parameter. </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; nu_init and its default value is 10<sup>-06</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_nu_inc"></a><a href="#OPT_nu_inc">&#x25B8;&nbsp;</a><b>nu_inc</b> (<em>advanced</em>): Increment of the penalty parameter. </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; nu_inc and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_rho"></a><a href="#OPT_rho">&#x25B8;&nbsp;</a><b>rho</b> (<em>advanced</em>): Value in penalty parameter update formula. </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; rho &lt; 1 and its default value is 0.1. </p>
</blockquote>
<p><a class="anchor" id="OPT_kappa_sigma"></a><a href="#OPT_kappa_sigma">&#x25B8;&nbsp;</a><b>kappa_sigma</b> (<em>advanced</em>): Factor limiting the deviation of dual variables from primal estimates. </p><blockquote class="doxtable">
<p>If the dual variables deviate from their primal estimates, a correction is performed. See Eqn. (16) in the implementation paper. Setting the value to less than 1 disables the correction. The valid range for this real option is 0 &lt; kappa_sigma and its default value is 10<sup>+10</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_recalc_y"></a><a href="#OPT_recalc_y">&#x25B8;&nbsp;</a><b>recalc_y</b>: Tells the algorithm to recalculate the equality and inequality multipliers as least square estimates. </p><blockquote class="doxtable">
<p>This asks the algorithm to recompute the multipliers, whenever the current infeasibility is less than recalc_y_feas_tol. Choosing yes might be helpful in the quasi-Newton option. However, each recalculation requires an extra factorization of the linear system. If a limited memory quasi-Newton option is chosen, this is used by default. The default value for this string option is "no".</p>
<p>Possible values:</p><ul>
<li>no: use the Newton step to update the multipliers</li>
<li>yes: use least-square multiplier estimates </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_recalc_y_feas_tol"></a><a href="#OPT_recalc_y_feas_tol">&#x25B8;&nbsp;</a><b>recalc_y_feas_tol</b>: Feasibility threshold for recomputation of multipliers. </p><blockquote class="doxtable">
<p>If recalc_y is chosen and the current infeasibility is less than this value, then the multipliers are recomputed. The valid range for this real option is 0 &lt; recalc_y_feas_tol and its default value is 10<sup>-06</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_slack_move"></a><a href="#OPT_slack_move">&#x25B8;&nbsp;</a><b>slack_move</b> (<em>advanced</em>): Correction size for very small slacks. </p><blockquote class="doxtable">
<p>Due to numerical issues or the lack of an interior, the slack variables might become very small. If a slack becomes very small compared to machine precision, the corresponding bound is moved slightly. This parameter determines how large the move should be. Its default value is mach_eps^{3/4}. See also end of Section 3.5 in implementation paper - but actual implementation might be somewhat different. The valid range for this real option is 0 &le; slack_move and its default value is 1.81899 &middot; 10<sup>-12</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_constraint_violation_norm_type"></a><a href="#OPT_constraint_violation_norm_type">&#x25B8;&nbsp;</a><b>constraint_violation_norm_type</b> (<em>advanced</em>): Norm to be used for the constraint violation in the line search. </p><blockquote class="doxtable">
<p>Determines which norm should be used when the algorithm computes the constraint violation in the line search. The default value for this string option is "1-norm".</p>
<p>Possible values:</p><ul>
<li>1-norm: use the 1-norm</li>
<li>2-norm: use the 2-norm</li>
<li>max-norm: use the infinity norm </li>
</ul>
</blockquote>
<h2><a class="anchor" id="OPT_Linear_Solver"></a>
Linear Solver</h2>
<p><a class="anchor" id="OPT_linear_solver"></a><a href="#OPT_linear_solver">&#x25B8;&nbsp;</a><b>linear_solver</b>: Linear solver used for step computations. </p><blockquote class="doxtable">
<p>Determines which linear algebra package is to be used for the solution of the augmented linear system (for obtaining the search directions). The default value for this string option is "ma27".</p>
<p>Possible values:</p><ul>
<li>ma27: use the Harwell routine MA27</li>
<li>ma57: use the Harwell routine MA57</li>
<li>ma77: use the Harwell routine HSL_MA77</li>
<li>ma86: use the Harwell routine HSL_MA86</li>
<li>ma97: use the Harwell routine HSL_MA97</li>
<li>pardiso: use the Pardiso package from pardiso-project.org</li>
<li>pardisomkl: use the Pardiso package from Intel MKL</li>
<li>spral: use the Spral package</li>
<li>wsmp: use the Wsmp package</li>
<li>mumps: use the Mumps package</li>
<li>custom: use custom linear solver (expert use) </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_linear_system_scaling"></a><a href="#OPT_linear_system_scaling">&#x25B8;&nbsp;</a><b>linear_system_scaling</b>: Method for scaling the linear system. </p><blockquote class="doxtable">
<p>Determines the method used to compute symmetric scaling factors for the augmented system (see also the "linear_scaling_on_demand" option). This scaling is independent of the NLP problem scaling. The default is MC19 only if MA27, MA57, MA77, or MA86 are selected as linear solvers. Otherwise it is 'none'. The default value for this string option is "mc19".</p>
<p>Possible values:</p><ul>
<li>none: no scaling will be performed</li>
<li>mc19: use the Harwell routine MC19</li>
<li>slack-based: use the slack values </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_hsllib"></a><a href="#OPT_hsllib">&#x25B8;&nbsp;</a><b>hsllib</b>: Name of library containing HSL routines for load at runtime </p><blockquote class="doxtable">
<p>The default value for this string option is "libhsl.so" ("libhsl.dylib" on macOS, "libhsl.dll" on Windows).</p>
<p>Possible values:</p><ul>
<li>*: Any acceptable filename (may contain path, too) </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_pardisolib"></a><a href="#OPT_pardisolib">&#x25B8;&nbsp;</a><b>pardisolib</b>: Name of library containing Pardiso routines (from pardiso-project.org) for load at runtime </p><blockquote class="doxtable">
<p>The default value for this string option is "/home/stefan/work/coin/libpardiso600-GNU800-X86-64.so".</p>
<p>Possible values:</p><ul>
<li>*: Any acceptable filename (may contain path, too) </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_linear_scaling_on_demand"></a><a href="#OPT_linear_scaling_on_demand">&#x25B8;&nbsp;</a><b>linear_scaling_on_demand</b>: Flag indicating that linear scaling is only done if it seems required. </p><blockquote class="doxtable">
<p>This option is only important if a linear scaling method (e.g., mc19) is used. If you choose "no", then the scaling factors are computed for every linear system from the start. This can be quite expensive. Choosing "yes" means that the algorithm will start the scaling method only when the solutions to the linear system seem not good, and then use it until the end. The default value for this string option is "yes".</p>
<p>Possible values: yes, no </p>
</blockquote>
<h2><a class="anchor" id="OPT_Step_Calculation"></a>
Step Calculation</h2>
<p><a class="anchor" id="OPT_mehrotra_algorithm"></a><a href="#OPT_mehrotra_algorithm">&#x25B8;&nbsp;</a><b>mehrotra_algorithm</b>: Indicates whether to do Mehrotra's predictor-corrector algorithm. </p><blockquote class="doxtable">
<p>If enabled, line search is disabled and the (unglobalized) adaptive mu strategy is chosen with the "probing" oracle, and "corrector_type=affine" is used without any safeguards; you should not set any of those options explicitly in addition. Also, unless otherwise specified, the values of "bound_push", "bound_frac", and "bound_mult_init_val" are set more aggressive, and sets "alpha_for_y=bound_mult". The Mehrotra's predictor-corrector algorithm works usually very well for LPs and convex QPs. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_fast_step_computation"></a><a href="#OPT_fast_step_computation">&#x25B8;&nbsp;</a><b>fast_step_computation</b>: Indicates if the linear system should be solved quickly. </p><blockquote class="doxtable">
<p>If enabled, the algorithm assumes that the linear system that is solved to obtain the search direction is solved sufficiently well. In that case, no residuals are computed to verify the solution and the computation of the search direction is a little faster. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_min_refinement_steps"></a><a href="#OPT_min_refinement_steps">&#x25B8;&nbsp;</a><b>min_refinement_steps</b>: Minimum number of iterative refinement steps per linear system solve. </p><blockquote class="doxtable">
<p>Iterative refinement (on the full unsymmetric system) is performed for each right hand side. This option determines the minimum number of iterative refinements (i.e. at least "min_refinement_steps" iterative refinement steps are enforced per right hand side.) The valid range for this integer option is 0 &le; min_refinement_steps and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_max_refinement_steps"></a><a href="#OPT_max_refinement_steps">&#x25B8;&nbsp;</a><b>max_refinement_steps</b>: Maximum number of iterative refinement steps per linear system solve. </p><blockquote class="doxtable">
<p>Iterative refinement (on the full unsymmetric system) is performed for each right hand side. This option determines the maximum number of iterative refinement steps. The valid range for this integer option is 0 &le; max_refinement_steps and its default value is 10. </p>
</blockquote>
<p><a class="anchor" id="OPT_residual_ratio_max"></a><a href="#OPT_residual_ratio_max">&#x25B8;&nbsp;</a><b>residual_ratio_max</b> (<em>advanced</em>): Iterative refinement tolerance </p><blockquote class="doxtable">
<p>Iterative refinement is performed until the residual test ratio is less than this tolerance (or until "max_refinement_steps" refinement steps are performed). The valid range for this real option is 0 &lt; residual_ratio_max and its default value is 10<sup>-10</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_residual_ratio_singular"></a><a href="#OPT_residual_ratio_singular">&#x25B8;&nbsp;</a><b>residual_ratio_singular</b> (<em>advanced</em>): Threshold for declaring linear system singular after failed iterative refinement. </p><blockquote class="doxtable">
<p>If the residual test ratio is larger than this value after failed iterative refinement, the algorithm pretends that the linear system is singular. The valid range for this real option is 0 &lt; residual_ratio_singular and its default value is 10<sup>-05</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_residual_improvement_factor"></a><a href="#OPT_residual_improvement_factor">&#x25B8;&nbsp;</a><b>residual_improvement_factor</b> (<em>advanced</em>): Minimal required reduction of residual test ratio in iterative refinement. </p><blockquote class="doxtable">
<p>If the improvement of the residual test ratio made by one iterative refinement step is not better than this factor, iterative refinement is aborted. The valid range for this real option is 0 &lt; residual_improvement_factor and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_neg_curv_test_tol"></a><a href="#OPT_neg_curv_test_tol">&#x25B8;&nbsp;</a><b>neg_curv_test_tol</b>: Tolerance for heuristic to ignore wrong inertia. </p><blockquote class="doxtable">
<p>If nonzero, incorrect inertia in the augmented system is ignored, and <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> tests if the direction is a direction of positive curvature. This tolerance is alpha_n in the paper by Zavala and Chiang (2014) and it determines when the direction is considered to be sufficiently positive. A value in the range of [1e-12, 1e-11] is recommended. The valid range for this real option is 0 &le; neg_curv_test_tol and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_neg_curv_test_reg"></a><a href="#OPT_neg_curv_test_reg">&#x25B8;&nbsp;</a><b>neg_curv_test_reg</b>: Whether to do the curvature test with the primal regularization (see Zavala and Chiang, 2014). </p><blockquote class="doxtable">
<p>The default value for this string option is "yes".</p>
<p>Possible values:</p><ul>
<li>yes: use primal regularization with the inertia-free curvature test</li>
<li>no: use original IPOPT approach, in which the primal regularization is ignored </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_max_hessian_perturbation"></a><a href="#OPT_max_hessian_perturbation">&#x25B8;&nbsp;</a><b>max_hessian_perturbation</b>: Maximum value of regularization parameter for handling negative curvature. </p><blockquote class="doxtable">
<p>In order to guarantee that the search directions are indeed proper descent directions, <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> requires that the inertia of the (augmented) linear system for the step computation has the correct number of negative and positive eigenvalues. The idea is that this guides the algorithm away from maximizers and makes <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> more likely converge to first order optimal points that are minimizers. If the inertia is not correct, a multiple of the identity matrix is added to the Hessian of the Lagrangian in the augmented system. This parameter gives the maximum value of the regularization parameter. If a regularization of that size is not enough, the algorithm skips this iteration and goes to the restoration phase. This is delta_w^max in the implementation paper. The valid range for this real option is 0 &lt; max_hessian_perturbation and its default value is 10<sup>+20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_min_hessian_perturbation"></a><a href="#OPT_min_hessian_perturbation">&#x25B8;&nbsp;</a><b>min_hessian_perturbation</b>: Smallest perturbation of the Hessian block. </p><blockquote class="doxtable">
<p>The size of the perturbation of the Hessian block is never selected smaller than this value, unless no perturbation is necessary. This is delta_w^min in implementation paper. The valid range for this real option is 0 &le; min_hessian_perturbation and its default value is 10<sup>-20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_perturb_inc_fact_first"></a><a href="#OPT_perturb_inc_fact_first">&#x25B8;&nbsp;</a><b>perturb_inc_fact_first</b>: Increase factor for x-s perturbation for very first perturbation. </p><blockquote class="doxtable">
<p>The factor by which the perturbation is increased when a trial value was not sufficient - this value is used for the computation of the very first perturbation and allows a different value for the first perturbation than that used for the remaining perturbations. This is bar_kappa_w^+ in the implementation paper. The valid range for this real option is 1 &lt; perturb_inc_fact_first and its default value is 100. </p>
</blockquote>
<p><a class="anchor" id="OPT_perturb_inc_fact"></a><a href="#OPT_perturb_inc_fact">&#x25B8;&nbsp;</a><b>perturb_inc_fact</b>: Increase factor for x-s perturbation. </p><blockquote class="doxtable">
<p>The factor by which the perturbation is increased when a trial value was not sufficient - this value is used for the computation of all perturbations except for the first. This is kappa_w^+ in the implementation paper. The valid range for this real option is 1 &lt; perturb_inc_fact and its default value is 8. </p>
</blockquote>
<p><a class="anchor" id="OPT_perturb_dec_fact"></a><a href="#OPT_perturb_dec_fact">&#x25B8;&nbsp;</a><b>perturb_dec_fact</b>: Decrease factor for x-s perturbation. </p><blockquote class="doxtable">
<p>The factor by which the perturbation is decreased when a trial value is deduced from the size of the most recent successful perturbation. This is kappa_w^- in the implementation paper. The valid range for this real option is 0 &lt; perturb_dec_fact &lt; 1 and its default value is 0.333333. </p>
</blockquote>
<p><a class="anchor" id="OPT_first_hessian_perturbation"></a><a href="#OPT_first_hessian_perturbation">&#x25B8;&nbsp;</a><b>first_hessian_perturbation</b>: Size of first x-s perturbation tried. </p><blockquote class="doxtable">
<p>The first value tried for the x-s perturbation in the inertia correction scheme. This is delta_0 in the implementation paper. The valid range for this real option is 0 &lt; first_hessian_perturbation and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_jacobian_regularization_value"></a><a href="#OPT_jacobian_regularization_value">&#x25B8;&nbsp;</a><b>jacobian_regularization_value</b>: Size of the regularization for rank-deficient constraint Jacobians. </p><blockquote class="doxtable">
<p>This is bar delta_c in the implementation paper. The valid range for this real option is 0 &le; jacobian_regularization_value and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_jacobian_regularization_exponent"></a><a href="#OPT_jacobian_regularization_exponent">&#x25B8;&nbsp;</a><b>jacobian_regularization_exponent</b> (<em>advanced</em>): Exponent for mu in the regularization for rank-deficient constraint Jacobians. </p><blockquote class="doxtable">
<p>This is kappa_c in the implementation paper. The valid range for this real option is 0 &le; jacobian_regularization_exponent and its default value is 0.25. </p>
</blockquote>
<p><a class="anchor" id="OPT_perturb_always_cd"></a><a href="#OPT_perturb_always_cd">&#x25B8;&nbsp;</a><b>perturb_always_cd</b> (<em>advanced</em>): Active permanent perturbation of constraint linearization. </p><blockquote class="doxtable">
<p>Enabling this option leads to using the delta_c and delta_d perturbation for the computation of every search direction. Usually, it is only used when the iteration matrix is singular. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<h2><a class="anchor" id="OPT_Restoration_Phase"></a>
Restoration Phase</h2>
<p><a class="anchor" id="OPT_expect_infeasible_problem"></a><a href="#OPT_expect_infeasible_problem">&#x25B8;&nbsp;</a><b>expect_infeasible_problem</b>: Enable heuristics to quickly detect an infeasible problem. </p><blockquote class="doxtable">
<p>This options is meant to activate heuristics that may speed up the infeasibility determination if you expect that there is a good chance for the problem to be infeasible. In the filter line search procedure, the restoration phase is called more quickly than usually, and more reduction in the constraint violation is enforced before the restoration phase is left. If the problem is square, this option is enabled automatically. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_expect_infeasible_problem_ctol"></a><a href="#OPT_expect_infeasible_problem_ctol">&#x25B8;&nbsp;</a><b>expect_infeasible_problem_ctol</b>: Threshold for disabling "expect_infeasible_problem" option. </p><blockquote class="doxtable">
<p>If the constraint violation becomes smaller than this threshold, the "expect_infeasible_problem" heuristics in the filter line search are disabled. If the problem is square, this options is set to 0. The valid range for this real option is 0 &le; expect_infeasible_problem_ctol and its default value is 0.001. </p>
</blockquote>
<p><a class="anchor" id="OPT_expect_infeasible_problem_ytol"></a><a href="#OPT_expect_infeasible_problem_ytol">&#x25B8;&nbsp;</a><b>expect_infeasible_problem_ytol</b>: Multiplier threshold for activating "expect_infeasible_problem" option. </p><blockquote class="doxtable">
<p>If the max norm of the constraint multipliers becomes larger than this value and "expect_infeasible_problem" is chosen, then the restoration phase is entered. The valid range for this real option is 0 &lt; expect_infeasible_problem_ytol and its default value is 10<sup>+08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_start_with_resto"></a><a href="#OPT_start_with_resto">&#x25B8;&nbsp;</a><b>start_with_resto</b>: Whether to switch to restoration phase in first iteration. </p><blockquote class="doxtable">
<p>Setting this option to "yes" forces the algorithm to switch to the feasibility restoration phase in the first iteration. If the initial point is feasible, the algorithm will abort with a failure. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_soft_resto_pderror_reduction_factor"></a><a href="#OPT_soft_resto_pderror_reduction_factor">&#x25B8;&nbsp;</a><b>soft_resto_pderror_reduction_factor</b>: Required reduction in primal-dual error in the soft restoration phase. </p><blockquote class="doxtable">
<p>The soft restoration phase attempts to reduce the primal-dual error with regular steps. If the damped primal-dual step (damped only to satisfy the fraction-to-the-boundary rule) is not decreasing the primal-dual error by at least this factor, then the regular restoration phase is called. Choosing "0" here disables the soft restoration phase. The valid range for this real option is 0 &le; soft_resto_pderror_reduction_factor and its default value is 0.9999. </p>
</blockquote>
<p><a class="anchor" id="OPT_max_soft_resto_iters"></a><a href="#OPT_max_soft_resto_iters">&#x25B8;&nbsp;</a><b>max_soft_resto_iters</b> (<em>advanced</em>): Maximum number of iterations performed successively in soft restoration phase. </p><blockquote class="doxtable">
<p>If the soft restoration phase is performed for more than so many iterations in a row, the regular restoration phase is called. The valid range for this integer option is 0 &le; max_soft_resto_iters and its default value is 10. </p>
</blockquote>
<p><a class="anchor" id="OPT_required_infeasibility_reduction"></a><a href="#OPT_required_infeasibility_reduction">&#x25B8;&nbsp;</a><b>required_infeasibility_reduction</b>: Required reduction of infeasibility before leaving restoration phase. </p><blockquote class="doxtable">
<p>The restoration phase algorithm is performed, until a point is found that is acceptable to the filter and the infeasibility has been reduced by at least the fraction given by this option. The valid range for this real option is 0 &le; required_infeasibility_reduction &lt; 1 and its default value is 0.9. </p>
</blockquote>
<p><a class="anchor" id="OPT_max_resto_iter"></a><a href="#OPT_max_resto_iter">&#x25B8;&nbsp;</a><b>max_resto_iter</b> (<em>advanced</em>): Maximum number of successive iterations in restoration phase. </p><blockquote class="doxtable">
<p>The algorithm terminates with an error message if the number of iterations successively taken in the restoration phase exceeds this number. The valid range for this integer option is 0 &le; max_resto_iter and its default value is 3000000. </p>
</blockquote>
<p><a class="anchor" id="OPT_evaluate_orig_obj_at_resto_trial"></a><a href="#OPT_evaluate_orig_obj_at_resto_trial">&#x25B8;&nbsp;</a><b>evaluate_orig_obj_at_resto_trial</b>: Determines if the original objective function should be evaluated at restoration phase trial points. </p><blockquote class="doxtable">
<p>Enabling this option makes the restoration phase algorithm evaluate the objective function of the original problem at every trial point encountered during the restoration phase, even if this value is not required. In this way, it is guaranteed that the original objective function can be evaluated without error at all accepted iterates; otherwise the algorithm might fail at a point where the restoration phase accepts an iterate that is good for the restoration phase problem, but not the original problem. On the other hand, if the evaluation of the original objective is expensive, this might be costly. The default value for this string option is "yes".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_resto_penalty_parameter"></a><a href="#OPT_resto_penalty_parameter">&#x25B8;&nbsp;</a><b>resto_penalty_parameter</b> (<em>advanced</em>): Penalty parameter in the restoration phase objective function. </p><blockquote class="doxtable">
<p>This is the parameter rho in equation (31a) in the <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> implementation paper. The valid range for this real option is 0 &lt; resto_penalty_parameter and its default value is 1000. </p>
</blockquote>
<p><a class="anchor" id="OPT_resto_proximity_weight"></a><a href="#OPT_resto_proximity_weight">&#x25B8;&nbsp;</a><b>resto_proximity_weight</b> (<em>advanced</em>): Weighting factor for the proximity term in restoration phase objective. </p><blockquote class="doxtable">
<p>This determines how the parameter zeta in equation (29a) in the implementation paper is computed. zeta here is resto_proximity_weight*sqrt(mu), where mu is the current barrier parameter. The valid range for this real option is 0 &le; resto_proximity_weight and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_bound_mult_reset_threshold"></a><a href="#OPT_bound_mult_reset_threshold">&#x25B8;&nbsp;</a><b>bound_mult_reset_threshold</b>: Threshold for resetting bound multipliers after the restoration phase. </p><blockquote class="doxtable">
<p>After returning from the restoration phase, the bound multipliers are updated with a Newton step for complementarity. Here, the change in the primal variables during the entire restoration phase is taken to be the corresponding primal Newton step. However, if after the update the largest bound multiplier exceeds the threshold specified by this option, the multipliers are all reset to 1. The valid range for this real option is 0 &le; bound_mult_reset_threshold and its default value is 1000. </p>
</blockquote>
<p><a class="anchor" id="OPT_constr_mult_reset_threshold"></a><a href="#OPT_constr_mult_reset_threshold">&#x25B8;&nbsp;</a><b>constr_mult_reset_threshold</b>: Threshold for resetting equality and inequality multipliers after restoration phase. </p><blockquote class="doxtable">
<p>After returning from the restoration phase, the constraint multipliers are recomputed by a least square estimate. This option triggers when those least-square estimates should be ignored. The valid range for this real option is 0 &le; constr_mult_reset_threshold and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_resto_failure_feasibility_threshold"></a><a href="#OPT_resto_failure_feasibility_threshold">&#x25B8;&nbsp;</a><b>resto_failure_feasibility_threshold</b> (<em>advanced</em>): Threshold for primal infeasibility to declare failure of restoration phase. </p><blockquote class="doxtable">
<p>If the restoration phase is terminated because of the "acceptable" termination criteria and the primal infeasibility is smaller than this value, the restoration phase is declared to have failed. The default value is actually 1e2*tol, where tol is the general termination tolerance. The valid range for this real option is 0 &le; resto_failure_feasibility_threshold and its default value is 0. </p>
</blockquote>
<h2><a class="anchor" id="OPT_Hessian_Approximation"></a>
Hessian Approximation</h2>
<p><a class="anchor" id="OPT_limited_memory_aug_solver"></a><a href="#OPT_limited_memory_aug_solver">&#x25B8;&nbsp;</a><b>limited_memory_aug_solver</b> (<em>advanced</em>): Strategy for solving the augmented system for low-rank Hessian. </p><blockquote class="doxtable">
<p>The default value for this string option is "sherman-morrison".</p>
<p>Possible values:</p><ul>
<li>sherman-morrison: use Sherman-Morrison formula</li>
<li>extended: use an extended augmented system </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_limited_memory_max_history"></a><a href="#OPT_limited_memory_max_history">&#x25B8;&nbsp;</a><b>limited_memory_max_history</b>: Maximum size of the history for the limited quasi-Newton Hessian approximation. </p><blockquote class="doxtable">
<p>This option determines the number of most recent iterations that are taken into account for the limited-memory quasi-Newton approximation. The valid range for this integer option is 0 &le; limited_memory_max_history and its default value is 6. </p>
</blockquote>
<p><a class="anchor" id="OPT_limited_memory_update_type"></a><a href="#OPT_limited_memory_update_type">&#x25B8;&nbsp;</a><b>limited_memory_update_type</b>: Quasi-Newton update formula for the limited memory quasi-Newton approximation. </p><blockquote class="doxtable">
<p>The default value for this string option is "bfgs".</p>
<p>Possible values:</p><ul>
<li>bfgs: BFGS update (with skipping)</li>
<li>sr1: SR1 (not working well) </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_limited_memory_initialization"></a><a href="#OPT_limited_memory_initialization">&#x25B8;&nbsp;</a><b>limited_memory_initialization</b>: Initialization strategy for the limited memory quasi-Newton approximation. </p><blockquote class="doxtable">
<p>Determines how the diagonal Matrix B_0 as the first term in the limited memory approximation should be computed. The default value for this string option is "scalar1".</p>
<p>Possible values:</p><ul>
<li>scalar1: sigma = s^Ty/s^Ts</li>
<li>scalar2: sigma = y^Ty/s^Ty</li>
<li>scalar3: arithmetic average of scalar1 and scalar2</li>
<li>scalar4: geometric average of scalar1 and scalar2</li>
<li>constant: sigma = limited_memory_init_val </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_limited_memory_init_val"></a><a href="#OPT_limited_memory_init_val">&#x25B8;&nbsp;</a><b>limited_memory_init_val</b>: Value for B0 in low-rank update. </p><blockquote class="doxtable">
<p>The starting matrix in the low rank update, B0, is chosen to be this multiple of the identity in the first iteration (when no updates have been performed yet), and is constantly chosen as this value, if "limited_memory_initialization" is "constant". The valid range for this real option is 0 &lt; limited_memory_init_val and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_limited_memory_init_val_max"></a><a href="#OPT_limited_memory_init_val_max">&#x25B8;&nbsp;</a><b>limited_memory_init_val_max</b>: Upper bound on value for B0 in low-rank update. </p><blockquote class="doxtable">
<p>The starting matrix in the low rank update, B0, is chosen to be this multiple of the identity in the first iteration (when no updates have been performed yet), and is constantly chosen as this value, if "limited_memory_initialization" is "constant". The valid range for this real option is 0 &lt; limited_memory_init_val_max and its default value is 10<sup>+08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_limited_memory_init_val_min"></a><a href="#OPT_limited_memory_init_val_min">&#x25B8;&nbsp;</a><b>limited_memory_init_val_min</b>: Lower bound on value for B0 in low-rank update. </p><blockquote class="doxtable">
<p>The starting matrix in the low rank update, B0, is chosen to be this multiple of the identity in the first iteration (when no updates have been performed yet), and is constantly chosen as this value, if "limited_memory_initialization" is "constant". The valid range for this real option is 0 &lt; limited_memory_init_val_min and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_limited_memory_max_skipping"></a><a href="#OPT_limited_memory_max_skipping">&#x25B8;&nbsp;</a><b>limited_memory_max_skipping</b>: Threshold for successive iterations where update is skipped. </p><blockquote class="doxtable">
<p>If the update is skipped more than this number of successive iterations, the quasi-Newton approximation is reset. The valid range for this integer option is 1 &le; limited_memory_max_skipping and its default value is 2. </p>
</blockquote>
<p><a class="anchor" id="OPT_limited_memory_special_for_resto"></a><a href="#OPT_limited_memory_special_for_resto">&#x25B8;&nbsp;</a><b>limited_memory_special_for_resto</b>: Determines if the quasi-Newton updates should be special during the restoration phase. </p><blockquote class="doxtable">
<p>Until Nov 2010, <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> used a special update during the restoration phase, but it turned out that this does not work well. The new default uses the regular update procedure and it improves results. If for some reason you want to get back to the original update, set this option to "yes". The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_hessian_approximation"></a><a href="#OPT_hessian_approximation">&#x25B8;&nbsp;</a><b>hessian_approximation</b>: Indicates what Hessian information is to be used. </p><blockquote class="doxtable">
<p>This determines which kind of information for the Hessian of the Lagrangian function is used by the algorithm. The default value for this string option is "exact".</p>
<p>Possible values:</p><ul>
<li>exact: Use second derivatives provided by the NLP.</li>
<li>limited-memory: Perform a limited-memory quasi-Newton approximation </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_hessian_approximation_space"></a><a href="#OPT_hessian_approximation_space">&#x25B8;&nbsp;</a><b>hessian_approximation_space</b> (<em>advanced</em>): Indicates in which subspace the Hessian information is to be approximated. </p><blockquote class="doxtable">
<p>The default value for this string option is "nonlinear-variables".</p>
<p>Possible values:</p><ul>
<li>nonlinear-variables: only in space of nonlinear variables.</li>
<li>all-variables: in space of all variables (without slacks) </li>
</ul>
</blockquote>
<h2><a class="anchor" id="OPT_Derivative_Checker"></a>
Derivative Checker</h2>
<p><a class="anchor" id="OPT_derivative_test"></a><a href="#OPT_derivative_test">&#x25B8;&nbsp;</a><b>derivative_test</b>: Enable derivative checker </p><blockquote class="doxtable">
<p>If this option is enabled, a (slow!) derivative test will be performed before the optimization. The test is performed at the user provided starting point and marks derivative values that seem suspicious The default value for this string option is "none".</p>
<p>Possible values:</p><ul>
<li>none: do not perform derivative test</li>
<li>first-order: perform test of first derivatives at starting point</li>
<li>second-order: perform test of first and second derivatives at starting point</li>
<li>only-second-order: perform test of second derivatives at starting point </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_derivative_test_first_index"></a><a href="#OPT_derivative_test_first_index">&#x25B8;&nbsp;</a><b>derivative_test_first_index</b>: Index of first quantity to be checked by derivative checker </p><blockquote class="doxtable">
<p>If this is set to -2, then all derivatives are checked. Otherwise, for the first derivative test it specifies the first variable for which the test is done (counting starts at 0). For second derivatives, it specifies the first constraint for which the test is done; counting of constraint indices starts at 0, and -1 refers to the objective function Hessian. The valid range for this integer option is -2 &le; derivative_test_first_index and its default value is -2. </p>
</blockquote>
<p><a class="anchor" id="OPT_derivative_test_perturbation"></a><a href="#OPT_derivative_test_perturbation">&#x25B8;&nbsp;</a><b>derivative_test_perturbation</b>: Size of the finite difference perturbation in derivative test. </p><blockquote class="doxtable">
<p>This determines the relative perturbation of the variable entries. The valid range for this real option is 0 &lt; derivative_test_perturbation and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_derivative_test_tol"></a><a href="#OPT_derivative_test_tol">&#x25B8;&nbsp;</a><b>derivative_test_tol</b>: Threshold for indicating wrong derivative. </p><blockquote class="doxtable">
<p>If the relative deviation of the estimated derivative from the given one is larger than this value, the corresponding derivative is marked as wrong. The valid range for this real option is 0 &lt; derivative_test_tol and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_derivative_test_print_all"></a><a href="#OPT_derivative_test_print_all">&#x25B8;&nbsp;</a><b>derivative_test_print_all</b>: Indicates whether information for all estimated derivatives should be printed. </p><blockquote class="doxtable">
<p>Determines verbosity of derivative checker. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_point_perturbation_radius"></a><a href="#OPT_point_perturbation_radius">&#x25B8;&nbsp;</a><b>point_perturbation_radius</b>: Maximal perturbation of an evaluation point. </p><blockquote class="doxtable">
<p>If a random perturbation of a points is required, this number indicates the maximal perturbation. This is for example used when determining the center point at which the finite difference derivative test is executed. The valid range for this real option is 0 &le; point_perturbation_radius and its default value is 10. </p>
</blockquote>
<h2><a class="anchor" id="OPT_MA27_Linear_Solver"></a>
MA27 Linear Solver</h2>
<p><a class="anchor" id="OPT_ma27_print_level"></a><a href="#OPT_ma27_print_level">&#x25B8;&nbsp;</a><b>ma27_print_level</b>: Debug printing level for the linear solver MA27 </p><blockquote class="doxtable">
<p>0: no printing; 1: Error messages only; 2: Error and warning messages; 3: Error and warning messages and terse monitoring; 4: All information. The valid range for this integer option is 0 &le; ma27_print_level &le; 4 and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma27_pivtol"></a><a href="#OPT_ma27_pivtol">&#x25B8;&nbsp;</a><b>ma27_pivtol</b>: Pivot tolerance for the linear solver MA27. </p><blockquote class="doxtable">
<p>A smaller number pivots for sparsity, a larger number pivots for stability. The valid range for this real option is 0 &lt; ma27_pivtol &lt; 1 and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma27_pivtolmax"></a><a href="#OPT_ma27_pivtolmax">&#x25B8;&nbsp;</a><b>ma27_pivtolmax</b>: Maximum pivot tolerance for the linear solver MA27. </p><blockquote class="doxtable">
<p><a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> may increase pivtol as high as ma27_pivtolmax to get a more accurate solution to the linear system. The valid range for this real option is 0 &lt; ma27_pivtolmax &lt; 1 and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma27_liw_init_factor"></a><a href="#OPT_ma27_liw_init_factor">&#x25B8;&nbsp;</a><b>ma27_liw_init_factor</b>: Integer workspace memory for MA27. </p><blockquote class="doxtable">
<p>The initial integer workspace memory = liw_init_factor * memory required by unfactored system. <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> will increase the workspace size by ma27_meminc_factor if required. The valid range for this real option is 1 &le; ma27_liw_init_factor and its default value is 5. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma27_la_init_factor"></a><a href="#OPT_ma27_la_init_factor">&#x25B8;&nbsp;</a><b>ma27_la_init_factor</b>: Real workspace memory for MA27. </p><blockquote class="doxtable">
<p>The initial real workspace memory = la_init_factor * memory required by unfactored system. <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> will increase the workspace size by ma27_meminc_factor if required. The valid range for this real option is 1 &le; ma27_la_init_factor and its default value is 5. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma27_meminc_factor"></a><a href="#OPT_ma27_meminc_factor">&#x25B8;&nbsp;</a><b>ma27_meminc_factor</b>: Increment factor for workspace size for MA27. </p><blockquote class="doxtable">
<p>If the integer or real workspace is not large enough, <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> will increase its size by this factor. The valid range for this real option is 1 &le; ma27_meminc_factor and its default value is 2. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma27_skip_inertia_check"></a><a href="#OPT_ma27_skip_inertia_check">&#x25B8;&nbsp;</a><b>ma27_skip_inertia_check</b> (<em>advanced</em>): Whether to always pretend that inertia is correct. </p><blockquote class="doxtable">
<p>Setting this option to "yes" essentially disables inertia check. This option makes the algorithm non-robust and easily fail, but it might give some insight into the necessity of inertia control. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_ma27_ignore_singularity"></a><a href="#OPT_ma27_ignore_singularity">&#x25B8;&nbsp;</a><b>ma27_ignore_singularity</b> (<em>advanced</em>): Whether to use MA27's ability to solve a linear system even if the matrix is singular. </p><blockquote class="doxtable">
<p>Setting this option to "yes" means that <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> will call MA27 to compute solutions for right hand sides, even if MA27 has detected that the matrix is singular (but is still able to solve the linear system). In some cases this might be better than using <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a>'s heuristic of small perturbation of the lower diagonal of the KKT matrix. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<h2><a class="anchor" id="OPT_MA57_Linear_Solver"></a>
MA57 Linear Solver</h2>
<p><a class="anchor" id="OPT_ma57_print_level"></a><a href="#OPT_ma57_print_level">&#x25B8;&nbsp;</a><b>ma57_print_level</b>: Debug printing level for the linear solver MA57 </p><blockquote class="doxtable">
<p>0: no printing; 1: Error messages only; 2: Error and warning messages; 3: Error and warning messages and terse monitoring; &gt;=4: All information. The valid range for this integer option is 0 &le; ma57_print_level and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma57_pivtol"></a><a href="#OPT_ma57_pivtol">&#x25B8;&nbsp;</a><b>ma57_pivtol</b>: Pivot tolerance for the linear solver MA57. </p><blockquote class="doxtable">
<p>A smaller number pivots for sparsity, a larger number pivots for stability. The valid range for this real option is 0 &lt; ma57_pivtol &lt; 1 and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma57_pivtolmax"></a><a href="#OPT_ma57_pivtolmax">&#x25B8;&nbsp;</a><b>ma57_pivtolmax</b>: Maximum pivot tolerance for the linear solver MA57. </p><blockquote class="doxtable">
<p><a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> may increase pivtol as high as ma57_pivtolmax to get a more accurate solution to the linear system. The valid range for this real option is 0 &lt; ma57_pivtolmax &lt; 1 and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma57_pre_alloc"></a><a href="#OPT_ma57_pre_alloc">&#x25B8;&nbsp;</a><b>ma57_pre_alloc</b>: Safety factor for work space memory allocation for the linear solver MA57. </p><blockquote class="doxtable">
<p>If 1 is chosen, the suggested amount of work space is used. However, choosing a larger number might avoid reallocation if the suggest values do not suffice. The valid range for this real option is 1 &le; ma57_pre_alloc and its default value is 1.05. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma57_pivot_order"></a><a href="#OPT_ma57_pivot_order">&#x25B8;&nbsp;</a><b>ma57_pivot_order</b>: Controls pivot order in MA57 </p><blockquote class="doxtable">
<p>This is ICNTL(6) in MA57. The valid range for this integer option is 0 &le; ma57_pivot_order &le; 5 and its default value is 5. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma57_automatic_scaling"></a><a href="#OPT_ma57_automatic_scaling">&#x25B8;&nbsp;</a><b>ma57_automatic_scaling</b>: Controls whether to enable automatic scaling in MA57 </p><blockquote class="doxtable">
<p>For higher reliability of the MA57 solver, you may want to set this option to yes. This is ICNTL(15) in MA57. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_ma57_block_size"></a><a href="#OPT_ma57_block_size">&#x25B8;&nbsp;</a><b>ma57_block_size</b>: Controls block size used by Level 3 BLAS in MA57BD </p><blockquote class="doxtable">
<p>This is ICNTL(11) in MA57. The valid range for this integer option is 1 &le; ma57_block_size and its default value is 16. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma57_node_amalgamation"></a><a href="#OPT_ma57_node_amalgamation">&#x25B8;&nbsp;</a><b>ma57_node_amalgamation</b>: Node amalgamation parameter </p><blockquote class="doxtable">
<p>This is ICNTL(12) in MA57. The valid range for this integer option is 1 &le; ma57_node_amalgamation and its default value is 16. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma57_small_pivot_flag"></a><a href="#OPT_ma57_small_pivot_flag">&#x25B8;&nbsp;</a><b>ma57_small_pivot_flag</b>: Handling of small pivots </p><blockquote class="doxtable">
<p>If set to 1, then when small entries defined by CNTL(2) are detected they are removed and the corresponding pivots placed at the end of the factorization. This can be particularly efficient if the matrix is highly rank deficient. This is ICNTL(16) in MA57. The valid range for this integer option is 0 &le; ma57_small_pivot_flag &le; 1 and its default value is 0. </p>
</blockquote>
<h2><a class="anchor" id="OPT_MA77_Linear_Solver"></a>
MA77 Linear Solver</h2>
<p><a class="anchor" id="OPT_ma77_print_level"></a><a href="#OPT_ma77_print_level">&#x25B8;&nbsp;</a><b>ma77_print_level</b>: Debug printing level for the linear solver MA77 </p><blockquote class="doxtable">
<p>&lt;0: no printing; 0: Error and warning messages only; 1: Limited diagnostic printing; &gt;1 Additional diagnostic printing. The valid range for this integer option is unrestricted and its default value is -1. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_buffer_lpage"></a><a href="#OPT_ma77_buffer_lpage">&#x25B8;&nbsp;</a><b>ma77_buffer_lpage</b>: Number of scalars per MA77 in-core buffer page in the out-of-core solver MA77 </p><blockquote class="doxtable">
<p>Must be at most ma77_file_size. The valid range for this integer option is 1 &le; ma77_buffer_lpage and its default value is 4096. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_buffer_npage"></a><a href="#OPT_ma77_buffer_npage">&#x25B8;&nbsp;</a><b>ma77_buffer_npage</b>: Number of pages that make up MA77 buffer </p><blockquote class="doxtable">
<p>Number of pages of size buffer_lpage that exist in-core for the out-of-core solver MA77. The valid range for this integer option is 1 &le; ma77_buffer_npage and its default value is 1600. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_file_size"></a><a href="#OPT_ma77_file_size">&#x25B8;&nbsp;</a><b>ma77_file_size</b>: Target size of each temporary file for MA77, scalars per type </p><blockquote class="doxtable">
<p>MA77 uses many temporary files, this option controls the size of each one. It is measured in the number of entries (int or double), NOT bytes. The valid range for this integer option is 1 &le; ma77_file_size and its default value is 2097152. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_maxstore"></a><a href="#OPT_ma77_maxstore">&#x25B8;&nbsp;</a><b>ma77_maxstore</b>: Maximum storage size for MA77 in-core mode </p><blockquote class="doxtable">
<p>If greater than zero, the maximum size of factors stored in core before out-of-core mode is invoked. The valid range for this integer option is 0 &le; ma77_maxstore and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_nemin"></a><a href="#OPT_ma77_nemin">&#x25B8;&nbsp;</a><b>ma77_nemin</b>: Node Amalgamation parameter </p><blockquote class="doxtable">
<p>Two nodes in elimination tree are merged if result has fewer than ma77_nemin variables. The valid range for this integer option is 1 &le; ma77_nemin and its default value is 8. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_small"></a><a href="#OPT_ma77_small">&#x25B8;&nbsp;</a><b>ma77_small</b>: Zero Pivot Threshold </p><blockquote class="doxtable">
<p>Any pivot less than ma77_small is treated as zero. The valid range for this real option is 0 &le; ma77_small and its default value is 10<sup>-20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_static"></a><a href="#OPT_ma77_static">&#x25B8;&nbsp;</a><b>ma77_static</b>: Static Pivoting Threshold </p><blockquote class="doxtable">
<p>See MA77 documentation. Either ma77_static=0.0 or ma77_static&gt;ma77_small. ma77_static=0.0 disables static pivoting. The valid range for this real option is 0 &le; ma77_static and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_u"></a><a href="#OPT_ma77_u">&#x25B8;&nbsp;</a><b>ma77_u</b>: Pivoting Threshold </p><blockquote class="doxtable">
<p>See MA77 documentation. The valid range for this real option is 0 &le; ma77_u &le; 0.5 and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_umax"></a><a href="#OPT_ma77_umax">&#x25B8;&nbsp;</a><b>ma77_umax</b>: Maximum Pivoting Threshold </p><blockquote class="doxtable">
<p>Maximum value to which u will be increased to improve quality. The valid range for this real option is 0 &le; ma77_umax &le; 0.5 and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma77_order"></a><a href="#OPT_ma77_order">&#x25B8;&nbsp;</a><b>ma77_order</b>: Controls type of ordering used by MA77 </p><blockquote class="doxtable">
<p>The default value for this string option is "metis".</p>
<p>Possible values:</p><ul>
<li>amd: Use the HSL_MC68 approximate minimum degree algorithm</li>
<li>metis: Use the MeTiS nested dissection algorithm (if available) </li>
</ul>
</blockquote>
<h2><a class="anchor" id="OPT_MA86_Linear_Solver"></a>
MA86 Linear Solver</h2>
<p><a class="anchor" id="OPT_ma86_print_level"></a><a href="#OPT_ma86_print_level">&#x25B8;&nbsp;</a><b>ma86_print_level</b>: Debug printing level </p><blockquote class="doxtable">
<p>&lt;0: no printing; 0: Error and warning messages only; 1: Limited diagnostic printing; &gt;1 Additional diagnostic printing. The valid range for this integer option is unrestricted and its default value is -1. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma86_nemin"></a><a href="#OPT_ma86_nemin">&#x25B8;&nbsp;</a><b>ma86_nemin</b>: Node Amalgamation parameter </p><blockquote class="doxtable">
<p>Two nodes in elimination tree are merged if result has fewer than ma86_nemin variables. The valid range for this integer option is 1 &le; ma86_nemin and its default value is 32. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma86_small"></a><a href="#OPT_ma86_small">&#x25B8;&nbsp;</a><b>ma86_small</b>: Zero Pivot Threshold </p><blockquote class="doxtable">
<p>Any pivot less than ma86_small is treated as zero. The valid range for this real option is 0 &le; ma86_small and its default value is 10<sup>-20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma86_static"></a><a href="#OPT_ma86_static">&#x25B8;&nbsp;</a><b>ma86_static</b>: Static Pivoting Threshold </p><blockquote class="doxtable">
<p>See MA86 documentation. Either ma86_static=0.0 or ma86_static&gt;ma86_small. ma86_static=0.0 disables static pivoting. The valid range for this real option is 0 &le; ma86_static and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma86_u"></a><a href="#OPT_ma86_u">&#x25B8;&nbsp;</a><b>ma86_u</b>: Pivoting Threshold </p><blockquote class="doxtable">
<p>See MA86 documentation. The valid range for this real option is 0 &le; ma86_u &le; 0.5 and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma86_umax"></a><a href="#OPT_ma86_umax">&#x25B8;&nbsp;</a><b>ma86_umax</b>: Maximum Pivoting Threshold </p><blockquote class="doxtable">
<p>Maximum value to which u will be increased to improve quality. The valid range for this real option is 0 &le; ma86_umax &le; 0.5 and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma86_scaling"></a><a href="#OPT_ma86_scaling">&#x25B8;&nbsp;</a><b>ma86_scaling</b>: Controls scaling of matrix </p><blockquote class="doxtable">
<p>The default value for this string option is "mc64".</p>
<p>Possible values:</p><ul>
<li>none: Do not scale the linear system matrix</li>
<li>mc64: Scale linear system matrix using MC64</li>
<li>mc77: Scale linear system matrix using MC77 [1,3,0] </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_ma86_order"></a><a href="#OPT_ma86_order">&#x25B8;&nbsp;</a><b>ma86_order</b>: Controls type of ordering </p><blockquote class="doxtable">
<p>The default value for this string option is "auto".</p>
<p>Possible values:</p><ul>
<li>auto: Try both AMD and MeTiS, pick best</li>
<li>amd: Use the HSL_MC68 approximate minimum degree algorithm</li>
<li>metis: Use the MeTiS nested dissection algorithm (if available) </li>
</ul>
</blockquote>
<h2><a class="anchor" id="OPT_MA97_Linear_Solver"></a>
MA97 Linear Solver</h2>
<p><a class="anchor" id="OPT_ma97_print_level"></a><a href="#OPT_ma97_print_level">&#x25B8;&nbsp;</a><b>ma97_print_level</b>: Debug printing level </p><blockquote class="doxtable">
<p>&lt;0: no printing; 0: Error and warning messages only; 1: Limited diagnostic printing; &gt;1 Additional diagnostic printing. The valid range for this integer option is unrestricted and its default value is -1. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma97_nemin"></a><a href="#OPT_ma97_nemin">&#x25B8;&nbsp;</a><b>ma97_nemin</b>: Node Amalgamation parameter </p><blockquote class="doxtable">
<p>Two nodes in elimination tree are merged if result has fewer than ma97_nemin variables. The valid range for this integer option is 1 &le; ma97_nemin and its default value is 8. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma97_small"></a><a href="#OPT_ma97_small">&#x25B8;&nbsp;</a><b>ma97_small</b>: Zero Pivot Threshold </p><blockquote class="doxtable">
<p>Any pivot less than ma97_small is treated as zero. The valid range for this real option is 0 &le; ma97_small and its default value is 10<sup>-20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma97_u"></a><a href="#OPT_ma97_u">&#x25B8;&nbsp;</a><b>ma97_u</b>: Pivoting Threshold </p><blockquote class="doxtable">
<p>See MA97 documentation. The valid range for this real option is 0 &le; ma97_u &le; 0.5 and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma97_umax"></a><a href="#OPT_ma97_umax">&#x25B8;&nbsp;</a><b>ma97_umax</b>: Maximum Pivoting Threshold </p><blockquote class="doxtable">
<p>See MA97 documentation. The valid range for this real option is 0 &le; ma97_umax &le; 0.5 and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_ma97_scaling"></a><a href="#OPT_ma97_scaling">&#x25B8;&nbsp;</a><b>ma97_scaling</b>: Specifies strategy for scaling </p><blockquote class="doxtable">
<p>The default value for this string option is "dynamic".</p>
<p>Possible values:</p><ul>
<li>none: Do not scale the linear system matrix</li>
<li>mc30: Scale all linear system matrices using MC30</li>
<li>mc64: Scale all linear system matrices using MC64</li>
<li>mc77: Scale all linear system matrices using MC77 [1,3,0]</li>
<li>dynamic: Dynamically select scaling according to rules specified by ma97_scalingX and ma97_switchX options. </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_ma97_scaling1"></a><a href="#OPT_ma97_scaling1">&#x25B8;&nbsp;</a><b>ma97_scaling1</b> (<em>advanced</em>): First scaling. </p><blockquote class="doxtable">
<p>If ma97_scaling=dynamic, this scaling is used according to the trigger ma97_switch1. If ma97_switch2 is triggered it is disabled. The default value for this string option is "mc64".</p>
<p>Possible values:</p><ul>
<li>none: No scaling</li>
<li>mc30: Scale linear system matrix using MC30</li>
<li>mc64: Scale linear system matrix using MC64</li>
<li>mc77: Scale linear system matrix using MC77 [1,3,0] </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_ma97_switch1"></a><a href="#OPT_ma97_switch1">&#x25B8;&nbsp;</a><b>ma97_switch1</b> (<em>advanced</em>): First switch, determine when ma97_scaling1 is enabled. </p><blockquote class="doxtable">
<p>If ma97_scaling=dynamic, ma97_scaling1 is enabled according to this condition. If ma97_switch2 occurs this option is henceforth ignored. The default value for this string option is "od_hd_reuse".</p>
<p>Possible values:</p><ul>
<li>never: Scaling is never enabled.</li>
<li>at_start: Scaling to be used from the very start.</li>
<li>at_start_reuse: Scaling to be used on first iteration, then reused thereafter.</li>
<li>on_demand: Scaling to be used after <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> request improved solution (i.e. iterative refinement has failed).</li>
<li>on_demand_reuse: As on_demand, but reuse scaling from previous itr</li>
<li>high_delay: Scaling to be used after more than 0.05*n delays are present</li>
<li>high_delay_reuse: Scaling to be used only when previous itr created more that 0.05*n additional delays, otherwise reuse scaling from previous itr</li>
<li>od_hd: Combination of on_demand and high_delay</li>
<li>od_hd_reuse: Combination of on_demand_reuse and high_delay_reuse </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_ma97_scaling2"></a><a href="#OPT_ma97_scaling2">&#x25B8;&nbsp;</a><b>ma97_scaling2</b> (<em>advanced</em>): Second scaling. </p><blockquote class="doxtable">
<p>If ma97_scaling=dynamic, this scaling is used according to the trigger ma97_switch2. If ma97_switch3 is triggered it is disabled. The default value for this string option is "mc64".</p>
<p>Possible values:</p><ul>
<li>none: No scaling</li>
<li>mc30: Scale linear system matrix using MC30</li>
<li>mc64: Scale linear system matrix using MC64</li>
<li>mc77: Scale linear system matrix using MC77 [1,3,0] </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_ma97_switch2"></a><a href="#OPT_ma97_switch2">&#x25B8;&nbsp;</a><b>ma97_switch2</b> (<em>advanced</em>): Second switch, determine when ma97_scaling2 is enabled. </p><blockquote class="doxtable">
<p>If ma97_scaling=dynamic, ma97_scaling2 is enabled according to this condition. If ma97_switch3 occurs this option is henceforth ignored. The default value for this string option is "never".</p>
<p>Possible values:</p><ul>
<li>never: Scaling is never enabled.</li>
<li>at_start: Scaling to be used from the very start.</li>
<li>at_start_reuse: Scaling to be used on first iteration, then reused thereafter.</li>
<li>on_demand: Scaling to be used after <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> request improved solution (i.e. iterative refinement has failed).</li>
<li>on_demand_reuse: As on_demand, but reuse scaling from previous itr</li>
<li>high_delay: Scaling to be used after more than 0.05*n delays are present</li>
<li>high_delay_reuse: Scaling to be used only when previous itr created more that 0.05*n additional delays, otherwise reuse scaling from previous itr</li>
<li>od_hd: Combination of on_demand and high_delay</li>
<li>od_hd_reuse: Combination of on_demand_reuse and high_delay_reuse </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_ma97_scaling3"></a><a href="#OPT_ma97_scaling3">&#x25B8;&nbsp;</a><b>ma97_scaling3</b> (<em>advanced</em>): Third scaling. </p><blockquote class="doxtable">
<p>If ma97_scaling=dynamic, this scaling is used according to the trigger ma97_switch3. The default value for this string option is "mc64".</p>
<p>Possible values:</p><ul>
<li>none: No scaling</li>
<li>mc30: Scale linear system matrix using MC30</li>
<li>mc64: Scale linear system matrix using MC64</li>
<li>mc77: Scale linear system matrix using MC77 [1,3,0] </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_ma97_switch3"></a><a href="#OPT_ma97_switch3">&#x25B8;&nbsp;</a><b>ma97_switch3</b> (<em>advanced</em>): Third switch, determine when ma97_scaling3 is enabled. </p><blockquote class="doxtable">
<p>If ma97_scaling=dynamic, ma97_scaling3 is enabled according to this condition. The default value for this string option is "never".</p>
<p>Possible values:</p><ul>
<li>never: Scaling is never enabled.</li>
<li>at_start: Scaling to be used from the very start.</li>
<li>at_start_reuse: Scaling to be used on first iteration, then reused thereafter.</li>
<li>on_demand: Scaling to be used after <a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> request improved solution (i.e. iterative refinement has failed).</li>
<li>on_demand_reuse: As on_demand, but reuse scaling from previous itr</li>
<li>high_delay: Scaling to be used after more than 0.05*n delays are present</li>
<li>high_delay_reuse: Scaling to be used only when previous itr created more that 0.05*n additional delays, otherwise reuse scaling from previous itr</li>
<li>od_hd: Combination of on_demand and high_delay</li>
<li>od_hd_reuse: Combination of on_demand_reuse and high_delay_reuse </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_ma97_order"></a><a href="#OPT_ma97_order">&#x25B8;&nbsp;</a><b>ma97_order</b>: Controls type of ordering </p><blockquote class="doxtable">
<p>The default value for this string option is "auto".</p>
<p>Possible values:</p><ul>
<li>auto: Use HSL_MA97 heuristic to guess best of AMD and METIS</li>
<li>best: Try both AMD and MeTiS, pick best</li>
<li>amd: Use the HSL_MC68 approximate minimum degree algorithm</li>
<li>metis: Use the MeTiS nested dissection algorithm</li>
<li>matched-auto: Use the HSL_MC80 matching with heuristic choice of AMD or METIS</li>
<li>matched-metis: Use the HSL_MC80 matching based ordering with METIS</li>
<li>matched-amd: Use the HSL_MC80 matching based ordering with AMD </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_ma97_solve_blas3"></a><a href="#OPT_ma97_solve_blas3">&#x25B8;&nbsp;</a><b>ma97_solve_blas3</b> (<em>advanced</em>): Controls if blas2 or blas3 routines are used for solve </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values:</p><ul>
<li>no: Use BLAS2 (faster, some implementations bit incompatible)</li>
<li>yes: Use BLAS3 (slower) </li>
</ul>
</blockquote>
<h2><a class="anchor" id="OPT_Pardiso__pardiso_project_org__Linear_Solver"></a>
Pardiso (pardiso-project.org) Linear Solver</h2>
<p><a class="anchor" id="OPT_pardiso_matching_strategy"></a><a href="#OPT_pardiso_matching_strategy">&#x25B8;&nbsp;</a><b>pardiso_matching_strategy</b>: Matching strategy to be used by Pardiso </p><blockquote class="doxtable">
<p>This is IPAR(13) in Pardiso manual. The default value for this string option is "complete+2x2".</p>
<p>Possible values:</p><ul>
<li>complete: Match complete (IPAR(13)=1)</li>
<li>complete+2x2: Match complete+2x2 (IPAR(13)=2)</li>
<li>constraints: Match constraints (IPAR(13)=3) </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_redo_symbolic_fact_only_if_inertia_wrong"></a><a href="#OPT_pardiso_redo_symbolic_fact_only_if_inertia_wrong">&#x25B8;&nbsp;</a><b>pardiso_redo_symbolic_fact_only_if_inertia_wrong</b> (<em>advanced</em>): Toggle for handling case when elements were perturbed by Pardiso. </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values:</p><ul>
<li>no: Always redo symbolic factorization when elements were perturbed</li>
<li>yes: Only redo symbolic factorization when elements were perturbed if also the inertia was wrong </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_repeated_perturbation_means_singular"></a><a href="#OPT_pardiso_repeated_perturbation_means_singular">&#x25B8;&nbsp;</a><b>pardiso_repeated_perturbation_means_singular</b> (<em>advanced</em>): Whether to assume that matrix is singular if elements were perturbed after recent symbolic factorization. </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_msglvl"></a><a href="#OPT_pardiso_msglvl">&#x25B8;&nbsp;</a><b>pardiso_msglvl</b>: Pardiso message level </p><blockquote class="doxtable">
<p>This is MSGLVL in the Pardiso manual. The valid range for this integer option is 0 &le; pardiso_msglvl and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_skip_inertia_check"></a><a href="#OPT_pardiso_skip_inertia_check">&#x25B8;&nbsp;</a><b>pardiso_skip_inertia_check</b> (<em>advanced</em>): Whether to pretend that inertia is correct. </p><blockquote class="doxtable">
<p>Setting this option to "yes" essentially disables inertia check. This option makes the algorithm non-robust and easily fail, but it might give some insight into the necessity of inertia control. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_max_iterative_refinement_steps"></a><a href="#OPT_pardiso_max_iterative_refinement_steps">&#x25B8;&nbsp;</a><b>pardiso_max_iterative_refinement_steps</b>: Limit on number of iterative refinement steps. </p><blockquote class="doxtable">
<p>The solver does not perform more than the absolute value of this value steps of iterative refinement and stops the process if a satisfactory level of accuracy of the solution in terms of backward error is achieved. If negative, the accumulation of the residue uses extended precision real and complex data types. Perturbed pivots result in iterative refinement. The solver automatically performs two steps of iterative refinements when perturbed pivots are obtained during the numerical factorization and this option is set to 0. The valid range for this integer option is unrestricted and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_order"></a><a href="#OPT_pardiso_order">&#x25B8;&nbsp;</a><b>pardiso_order</b>: Controls the fill-in reduction ordering algorithm for the input matrix. </p><blockquote class="doxtable">
<p>The default value for this string option is "metis".</p>
<p>Possible values:</p><ul>
<li>amd: minimum degree algorithm</li>
<li>one</li>
<li>metis: MeTiS nested dissection algorithm</li>
<li>pmetis: parallel (OpenMP) version of MeTiS nested dissection algorithm</li>
<li>four</li>
<li>five </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_max_iter"></a><a href="#OPT_pardiso_max_iter">&#x25B8;&nbsp;</a><b>pardiso_max_iter</b> (<em>advanced</em>): Maximum number of Krylov-Subspace Iteration </p><blockquote class="doxtable">
<p>DPARM(1) The valid range for this integer option is 1 &le; pardiso_max_iter and its default value is 500. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_iter_relative_tol"></a><a href="#OPT_pardiso_iter_relative_tol">&#x25B8;&nbsp;</a><b>pardiso_iter_relative_tol</b> (<em>advanced</em>): Relative Residual Convergence </p><blockquote class="doxtable">
<p>DPARM(2) The valid range for this real option is 0 &lt; pardiso_iter_relative_tol &lt; 1 and its default value is 10<sup>-06</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_iter_coarse_size"></a><a href="#OPT_pardiso_iter_coarse_size">&#x25B8;&nbsp;</a><b>pardiso_iter_coarse_size</b> (<em>advanced</em>): Maximum Size of Coarse Grid Matrix </p><blockquote class="doxtable">
<p>DPARM(3) The valid range for this integer option is 1 &le; pardiso_iter_coarse_size and its default value is 5000. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_iter_max_levels"></a><a href="#OPT_pardiso_iter_max_levels">&#x25B8;&nbsp;</a><b>pardiso_iter_max_levels</b> (<em>advanced</em>): Maximum Size of Grid Levels </p><blockquote class="doxtable">
<p>DPARM(4) The valid range for this integer option is 1 &le; pardiso_iter_max_levels and its default value is 10. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_iter_dropping_factor"></a><a href="#OPT_pardiso_iter_dropping_factor">&#x25B8;&nbsp;</a><b>pardiso_iter_dropping_factor</b> (<em>advanced</em>): dropping value for incomplete factor </p><blockquote class="doxtable">
<p>DPARM(5) The valid range for this real option is 0 &lt; pardiso_iter_dropping_factor &lt; 1 and its default value is 0.5. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_iter_dropping_schur"></a><a href="#OPT_pardiso_iter_dropping_schur">&#x25B8;&nbsp;</a><b>pardiso_iter_dropping_schur</b> (<em>advanced</em>): dropping value for sparsify schur complement factor </p><blockquote class="doxtable">
<p>DPARM(6) The valid range for this real option is 0 &lt; pardiso_iter_dropping_schur &lt; 1 and its default value is 0.1. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_iter_max_row_fill"></a><a href="#OPT_pardiso_iter_max_row_fill">&#x25B8;&nbsp;</a><b>pardiso_iter_max_row_fill</b> (<em>advanced</em>): max fill for each row </p><blockquote class="doxtable">
<p>DPARM(7) The valid range for this integer option is 1 &le; pardiso_iter_max_row_fill and its default value is 10000000. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_iter_inverse_norm_factor"></a><a href="#OPT_pardiso_iter_inverse_norm_factor">&#x25B8;&nbsp;</a><b>pardiso_iter_inverse_norm_factor</b> (<em>advanced</em>) </p><blockquote class="doxtable">
<p>DPARM(8) The valid range for this real option is 1 &lt; pardiso_iter_inverse_norm_factor and its default value is 5 &middot; 10<sup>+06</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_iterative"></a><a href="#OPT_pardiso_iterative">&#x25B8;&nbsp;</a><b>pardiso_iterative</b> (<em>advanced</em>): Switch for iterative solver in Pardiso library </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_pardiso_max_droptol_corrections"></a><a href="#OPT_pardiso_max_droptol_corrections">&#x25B8;&nbsp;</a><b>pardiso_max_droptol_corrections</b> (<em>advanced</em>): Maximal number of decreases of drop tolerance during one solve. </p><blockquote class="doxtable">
<p>This is relevant only for iterative Pardiso options. The valid range for this integer option is 1 &le; pardiso_max_droptol_corrections and its default value is 4. </p>
</blockquote>
<h2><a class="anchor" id="OPT_Pardiso__MKL__Linear_Solver"></a>
Pardiso (MKL) Linear Solver</h2>
<p><a class="anchor" id="OPT_pardisomkl_matching_strategy"></a><a href="#OPT_pardisomkl_matching_strategy">&#x25B8;&nbsp;</a><b>pardisomkl_matching_strategy</b>: Matching strategy to be used by Pardiso </p><blockquote class="doxtable">
<p>This is IPAR(13) in Pardiso manual. The default value for this string option is "complete+2x2".</p>
<p>Possible values:</p><ul>
<li>complete: Match complete (IPAR(13)=1)</li>
<li>complete+2x2: Match complete+2x2 (IPAR(13)=2)</li>
<li>constraints: Match constraints (IPAR(13)=3) </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_pardisomkl_redo_symbolic_fact_only_if_inertia_wrong"></a><a href="#OPT_pardisomkl_redo_symbolic_fact_only_if_inertia_wrong">&#x25B8;&nbsp;</a><b>pardisomkl_redo_symbolic_fact_only_if_inertia_wrong</b> (<em>advanced</em>): Toggle for handling case when elements were perturbed by Pardiso. </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values:</p><ul>
<li>no: Always redo symbolic factorization when elements were perturbed</li>
<li>yes: Only redo symbolic factorization when elements were perturbed if also the inertia was wrong </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_pardisomkl_repeated_perturbation_means_singular"></a><a href="#OPT_pardisomkl_repeated_perturbation_means_singular">&#x25B8;&nbsp;</a><b>pardisomkl_repeated_perturbation_means_singular</b> (<em>advanced</em>): Whether to assume that matrix is singular if elements were perturbed after recent symbolic factorization. </p><blockquote class="doxtable">
<p>The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_pardisomkl_msglvl"></a><a href="#OPT_pardisomkl_msglvl">&#x25B8;&nbsp;</a><b>pardisomkl_msglvl</b>: Pardiso message level </p><blockquote class="doxtable">
<p>This is MSGLVL in the Pardiso manual. The valid range for this integer option is 0 &le; pardisomkl_msglvl and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardisomkl_skip_inertia_check"></a><a href="#OPT_pardisomkl_skip_inertia_check">&#x25B8;&nbsp;</a><b>pardisomkl_skip_inertia_check</b> (<em>advanced</em>): Whether to pretend that inertia is correct. </p><blockquote class="doxtable">
<p>Setting this option to "yes" essentially disables inertia check. This option makes the algorithm non-robust and easily fail, but it might give some insight into the necessity of inertia control. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_pardisomkl_max_iterative_refinement_steps"></a><a href="#OPT_pardisomkl_max_iterative_refinement_steps">&#x25B8;&nbsp;</a><b>pardisomkl_max_iterative_refinement_steps</b>: Limit on number of iterative refinement steps. </p><blockquote class="doxtable">
<p>The solver does not perform more than the absolute value of this value steps of iterative refinement and stops the process if a satisfactory level of accuracy of the solution in terms of backward error is achieved. If negative, the accumulation of the residue uses extended precision real and complex data types. Perturbed pivots result in iterative refinement. The solver automatically performs two steps of iterative refinements when perturbed pivots are obtained during the numerical factorization and this option is set to 0. The valid range for this integer option is unrestricted and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_pardisomkl_order"></a><a href="#OPT_pardisomkl_order">&#x25B8;&nbsp;</a><b>pardisomkl_order</b>: Controls the fill-in reduction ordering algorithm for the input matrix. </p><blockquote class="doxtable">
<p>The default value for this string option is "metis".</p>
<p>Possible values:</p><ul>
<li>amd: minimum degree algorithm</li>
<li>one: undocumented</li>
<li>metis: MeTiS nested dissection algorithm</li>
<li>pmetis: parallel (OpenMP) version of MeTiS nested dissection algorithm </li>
</ul>
</blockquote>
<h2><a class="anchor" id="OPT_SPRAL_Linear_Solver"></a>
SPRAL Linear Solver</h2>
<p><a class="anchor" id="OPT_spral_cpu_block_size"></a><a href="#OPT_spral_cpu_block_size">&#x25B8;&nbsp;</a><b>spral_cpu_block_size</b>: CPU Parallelization Block Size </p><blockquote class="doxtable">
<p>Block size to use for parallelization of large nodes on CPU resources. The valid range for this integer option is 1 &le; spral_cpu_block_size and its default value is 256. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_gpu_perf_coeff"></a><a href="#OPT_spral_gpu_perf_coeff">&#x25B8;&nbsp;</a><b>spral_gpu_perf_coeff</b>: GPU Performance Coefficient </p><blockquote class="doxtable">
<p>How many times faster a GPU is than a CPU at factoring a subtree. The valid range for this real option is 0 &lt; spral_gpu_perf_coeff and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_ignore_numa"></a><a href="#OPT_spral_ignore_numa">&#x25B8;&nbsp;</a><b>spral_ignore_numa</b>: Non-uniform memory access (NUMA) region setting. </p><blockquote class="doxtable">
<p>The default value for this string option is "yes".</p>
<p>Possible values:</p><ul>
<li>no: Do not treat CPUs and GPUs as belonging to a single NUMA region.</li>
<li>yes: Treat CPUs and GPUs as belonging to a single NUMA region. </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_max_load_inbalance"></a><a href="#OPT_spral_max_load_inbalance">&#x25B8;&nbsp;</a><b>spral_max_load_inbalance</b>: Maximum Permissible Load </p><blockquote class="doxtable">
<p>Maximum permissible load inbalance for leaf subtree allocations. The valid range for this real option is 1 &lt; spral_max_load_inbalance and its default value is 1.2. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_min_gpu_work"></a><a href="#OPT_spral_min_gpu_work">&#x25B8;&nbsp;</a><b>spral_min_gpu_work</b>: Minimum GPU Work </p><blockquote class="doxtable">
<p>Minimum number of FLOPS in subtree before scheduling on GPU. The valid range for this real option is 0 &le; spral_min_gpu_work and its default value is 5 &middot; 10<sup>+09</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_nemin"></a><a href="#OPT_spral_nemin">&#x25B8;&nbsp;</a><b>spral_nemin</b>: Node Amalgamation Parameter </p><blockquote class="doxtable">
<p>Two nodes in the elimination tree are merged if the result has fewer than spral_nemin variables. The valid range for this integer option is 1 &le; spral_nemin and its default value is 32. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_order"></a><a href="#OPT_spral_order">&#x25B8;&nbsp;</a><b>spral_order</b>: Controls type of ordering used by SPRAL </p><blockquote class="doxtable">
<p>The default value for this string option is "matching".</p>
<p>Possible values:</p><ul>
<li>metis: Use METIS with default settings.</li>
<li>matching: Use matching-based elimination ordering. </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_pivot_method"></a><a href="#OPT_spral_pivot_method">&#x25B8;&nbsp;</a><b>spral_pivot_method</b>: Specifies strategy for scaling in SPRAL linear solver. </p><blockquote class="doxtable">
<p>The default value for this string option is "block".</p>
<p>Possible values:</p><ul>
<li>aggressive: Aggressive a posteori pivoting.</li>
<li>block: Block a posteori pivoting.</li>
<li>threshold: Threshold partial pivoting (not parallel). </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_print_level"></a><a href="#OPT_spral_print_level">&#x25B8;&nbsp;</a><b>spral_print_level</b>: Print level for the linear solver SPRAL </p><blockquote class="doxtable">
<p>&lt;0: no printing, 0: errors and warning messages, 1: limited diagnostics, &gt;1: additional diagnostics The valid range for this integer option is unrestricted and its default value is -1. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_scaling"></a><a href="#OPT_spral_scaling">&#x25B8;&nbsp;</a><b>spral_scaling</b>: Specifies strategy for scaling in SPRAL linear solver. </p><blockquote class="doxtable">
<p>The default value for this string option is "matching".</p>
<p>Possible values:</p><ul>
<li>none: Do not scale the linear system matrix.</li>
<li>mc64: Scale using weighted bipartite matching (MC64).</li>
<li>auction: Scale using the auction algorithm.</li>
<li>matching: Scale using the matching-based ordering.</li>
<li>ruiz: Scale using the norm-equilibration algorithm of Ruiz (MC77).</li>
<li>dynamic: Dynamically select scaling according to switch options. </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_scaling_1"></a><a href="#OPT_spral_scaling_1">&#x25B8;&nbsp;</a><b>spral_scaling_1</b> (<em>advanced</em>): First scaling strategy. </p><blockquote class="doxtable">
<p>If spral_scaling = dynamic, this scaling is used according to the trigger spral_switch_1. If spral_switch_2 is triggered, it is disabled. The default value for this string option is "matching".</p>
<p>Possible values:</p><ul>
<li>none: Do not scale the linear system matrix.</li>
<li>mc64: Scale using weighted bipartite matching (MC64).</li>
<li>auction: Scale using the auction algorithm.</li>
<li>matching: Scale using the matching-based ordering.</li>
<li>ruiz: Scale using the norm-equilibration algorithm of Ruiz (MC77). </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_scaling_2"></a><a href="#OPT_spral_scaling_2">&#x25B8;&nbsp;</a><b>spral_scaling_2</b> (<em>advanced</em>): Second scaling strategy. </p><blockquote class="doxtable">
<p>If spral_scaling = dynamic, this scaling is used according to the trigger spral_switch_2. If spral_switch_3 is triggered, it is disabled. The default value for this string option is "mc64".</p>
<p>Possible values:</p><ul>
<li>none: Do not scale the linear system matrix.</li>
<li>mc64: Scale using weighted bipartite matching (MC64).</li>
<li>auction: Scale using the auction algorithm.</li>
<li>matching: Scale using the matching-based ordering.</li>
<li>ruiz: Scale using the norm-equilibration algorithm of Ruiz (MC77). </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_scaling_3"></a><a href="#OPT_spral_scaling_3">&#x25B8;&nbsp;</a><b>spral_scaling_3</b> (<em>advanced</em>): Third scaling strategy. </p><blockquote class="doxtable">
<p>If spral_scaling = dynamic, this scaling is used according to the trigger spral_switch_3. The default value for this string option is "none".</p>
<p>Possible values:</p><ul>
<li>none: Do not scale the linear system matrix.</li>
<li>mc64: Scale using weighted bipartite matching (MC64).</li>
<li>auction: Scale using the auction algorithm.</li>
<li>matching: Scale using the matching-based ordering.</li>
<li>ruiz: Scale using the norm-equilibration algorithm of Ruiz (MC77). </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_switch_1"></a><a href="#OPT_spral_switch_1">&#x25B8;&nbsp;</a><b>spral_switch_1</b> (<em>advanced</em>): First switch, determining when spral_scaling_1 is enabled. </p><blockquote class="doxtable">
<p>If spral_scaling = dynamic, spral_scaling_1 is enabled according to this condition. If spral_switch_2 occurs, this option is henceforth ignored. The default value for this string option is "at_start".</p>
<p>Possible values:</p><ul>
<li>never: Scaling is never enabled.</li>
<li>at_start: Scaling is used from the very start.</li>
<li>at_start_reuse: Scaling is used on the first iteration, then reused thereafter.</li>
<li>on_demand: Scaling is used when iterative refinement has failed.</li>
<li>on_demand_reuse: As on_demand, but scaling from previous iteration is reused.</li>
<li>high_delay: Scaling is used after more than 0.05*n delays are present.</li>
<li>high_delay_reuse: Scaling is used only when previous iteration created more that 0.05*n additional delays; otherwise, reuse scaling from the previous iteration.</li>
<li>od_hd: Combination of on_demand and high_delay.</li>
<li>od_hd_reuse: Combination of on_demand_reuse and high_delay_reuse </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_switch_2"></a><a href="#OPT_spral_switch_2">&#x25B8;&nbsp;</a><b>spral_switch_2</b> (<em>advanced</em>): Second switch, determining when spral_scaling_2 is enabled. </p><blockquote class="doxtable">
<p>If spral_scaling = dynamic, spral_scaling_2 is enabled according to this condition. If spral_switch_3 occurs, this option is henceforth ignored. The default value for this string option is "on_demand".</p>
<p>Possible values:</p><ul>
<li>never: Scaling is never enabled.</li>
<li>at_start: Scaling is used from the very start.</li>
<li>at_start_reuse: Scaling is used on the first iteration, then reused thereafter.</li>
<li>on_demand: Scaling is used when iterative refinement has failed.</li>
<li>on_demand_reuse: As on_demand, but scaling from previous iteration is reused.</li>
<li>high_delay: Scaling is used after more than 0.05*n delays are present.</li>
<li>high_delay_reuse: Scaling is used only when previous iteration created more that 0.05*n additional delays; otherwise, reuse scaling from the previous iteration.</li>
<li>od_hd: Combination of on_demand and high_delay.</li>
<li>od_hd_reuse: Combination of on_demand_reuse and high_delay_reuse </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_switch_3"></a><a href="#OPT_spral_switch_3">&#x25B8;&nbsp;</a><b>spral_switch_3</b> (<em>advanced</em>): Third switch, determining when spral_scaling_3 is enabled. </p><blockquote class="doxtable">
<p>If spral_scaling = dynamic, spral_scaling_3 is enabled according to this condition. The default value for this string option is "never".</p>
<p>Possible values:</p><ul>
<li>never: Scaling is never enabled.</li>
<li>at_start: Scaling is used from the very start.</li>
<li>at_start_reuse: Scaling is used on the first iteration, then reused thereafter.</li>
<li>on_demand: Scaling is used when iterative refinement has failed.</li>
<li>on_demand_reuse: As on_demand, but scaling from previous iteration is reused.</li>
<li>high_delay: Scaling is used after more than 0.05*n delays are present.</li>
<li>high_delay_reuse: Scaling is used only when previous iteration created more that 0.05*n additional delays; otherwise, reuse scaling from the previous iteration.</li>
<li>od_hd: Combination of on_demand and high_delay.</li>
<li>od_hd_reuse: Combination of on_demand_reuse and high_delay_reuse </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_spral_small"></a><a href="#OPT_spral_small">&#x25B8;&nbsp;</a><b>spral_small</b>: Zero Pivot Threshold </p><blockquote class="doxtable">
<p>Any pivot less than spral_small is treated as zero. The valid range for this real option is 0 &lt; spral_small and its default value is 10<sup>-20</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_small_subtree_threshold"></a><a href="#OPT_spral_small_subtree_threshold">&#x25B8;&nbsp;</a><b>spral_small_subtree_threshold</b>: Small Subtree Threshold </p><blockquote class="doxtable">
<p>Maximum number of FLOPS in a subtree treated as a single task. The valid range for this real option is 0 &lt; spral_small_subtree_threshold and its default value is 4 &middot; 10<sup>+06</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_u"></a><a href="#OPT_spral_u">&#x25B8;&nbsp;</a><b>spral_u</b>: Pivoting Threshold </p><blockquote class="doxtable">
<p>Relative pivot threshold used in symmetric indefinite case. The valid range for this real option is 0 &lt; spral_u &le; 0.5 and its default value is 10<sup>-08</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_umax"></a><a href="#OPT_spral_umax">&#x25B8;&nbsp;</a><b>spral_umax</b>: Maximum Pivoting Threshold </p><blockquote class="doxtable">
<p>See SPRAL documentation. The valid range for this real option is 0 &lt; spral_umax &le; 0.5 and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_spral_use_gpu"></a><a href="#OPT_spral_use_gpu">&#x25B8;&nbsp;</a><b>spral_use_gpu</b>: Specifies whether or not graphics processing units (GPUs) are used by the SPRAL linear solver if present. </p><blockquote class="doxtable">
<p>The default value for this string option is "yes".</p>
<p>Possible values: yes, no </p>
</blockquote>
<h2><a class="anchor" id="OPT_WSMP_Linear_Solver"></a>
WSMP Linear Solver</h2>
<p><a class="anchor" id="OPT_wsmp_num_threads"></a><a href="#OPT_wsmp_num_threads">&#x25B8;&nbsp;</a><b>wsmp_num_threads</b>: Number of threads to be used in WSMP </p><blockquote class="doxtable">
<p>The valid range for this integer option is unrestricted and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_ordering_option"></a><a href="#OPT_wsmp_ordering_option">&#x25B8;&nbsp;</a><b>wsmp_ordering_option</b>: Determines how ordering is done in WSMP </p><blockquote class="doxtable">
<p>This corresponds to the value of WSSMP's IPARM(16). The valid range for this integer option is -2 &le; wsmp_ordering_option &le; 3 and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_ordering_option2"></a><a href="#OPT_wsmp_ordering_option2">&#x25B8;&nbsp;</a><b>wsmp_ordering_option2</b> (<em>advanced</em>): Determines how ordering is done in WSMP </p><blockquote class="doxtable">
<p>This corresponds to the value of WSSMP's IPARM(20). The valid range for this integer option is 0 &le; wsmp_ordering_option2 &le; 3 and its default value is 1. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_pivtol"></a><a href="#OPT_wsmp_pivtol">&#x25B8;&nbsp;</a><b>wsmp_pivtol</b>: Pivot tolerance for the linear solver WSMP. </p><blockquote class="doxtable">
<p>A smaller number pivots for sparsity, a larger number pivots for stability. The valid range for this real option is 0 &lt; wsmp_pivtol &lt; 1 and its default value is 0.0001. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_pivtolmax"></a><a href="#OPT_wsmp_pivtolmax">&#x25B8;&nbsp;</a><b>wsmp_pivtolmax</b>: Maximum pivot tolerance for the linear solver WSMP. </p><blockquote class="doxtable">
<p><a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> may increase pivtol as high as pivtolmax to get a more accurate solution to the linear system. The valid range for this real option is 0 &lt; wsmp_pivtolmax &lt; 1 and its default value is 0.1. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_scaling"></a><a href="#OPT_wsmp_scaling">&#x25B8;&nbsp;</a><b>wsmp_scaling</b>: Determines how the matrix is scaled by WSMP. </p><blockquote class="doxtable">
<p>This corresponds to the value of WSSMP's IPARM(10). The valid range for this integer option is 0 &le; wsmp_scaling &le; 3 and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_singularity_threshold"></a><a href="#OPT_wsmp_singularity_threshold">&#x25B8;&nbsp;</a><b>wsmp_singularity_threshold</b>: WSMP's singularity threshold. </p><blockquote class="doxtable">
<p>WSMP's DPARM(10) parameter. The smaller this value the less likely a matrix is declared singular. The valid range for this real option is 0 &lt; wsmp_singularity_threshold &lt; 1 and its default value is 10<sup>-18</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_write_matrix_iteration"></a><a href="#OPT_wsmp_write_matrix_iteration">&#x25B8;&nbsp;</a><b>wsmp_write_matrix_iteration</b> (<em>advanced</em>): Iteration in which the matrices are written to files. </p><blockquote class="doxtable">
<p>If non-negative, this option determines the iteration in which all matrices given to WSMP are written to files. The valid range for this integer option is -1 &le; wsmp_write_matrix_iteration and its default value is -1. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_skip_inertia_check"></a><a href="#OPT_wsmp_skip_inertia_check">&#x25B8;&nbsp;</a><b>wsmp_skip_inertia_check</b> (<em>advanced</em>): Whether to always pretend that inertia is correct. </p><blockquote class="doxtable">
<p>Setting this option to "yes" essentially disables inertia check. This option makes the algorithm non-robust and easily fail, but it might give some insight into the necessity of inertia control. The default value for this string option is "no".</p>
<p>Possible values: yes, no </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_no_pivoting"></a><a href="#OPT_wsmp_no_pivoting">&#x25B8;&nbsp;</a><b>wsmp_no_pivoting</b> (<em>advanced</em>): Whether to use the static pivoting option of WSMP. </p><blockquote class="doxtable">
<p>Setting this option to "yes" means that WSMP is instructed not to do pivoting. This works only in certain situations (when the Hessian block is known to be positive definite or when we are using L-BFGS). It can also lead to a lot of fill-in. The default value for this string option is "no".</p>
<p>Possible values:</p><ul>
<li>no: use the regular version</li>
<li>yes: use static pivoting </li>
</ul>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_max_iter"></a><a href="#OPT_wsmp_max_iter">&#x25B8;&nbsp;</a><b>wsmp_max_iter</b> (<em>advanced</em>): Maximal number of iterations in iterative WISMP </p><blockquote class="doxtable">
<p>The valid range for this integer option is 1 &le; wsmp_max_iter and its default value is 1000. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_inexact_droptol"></a><a href="#OPT_wsmp_inexact_droptol">&#x25B8;&nbsp;</a><b>wsmp_inexact_droptol</b> (<em>advanced</em>): Drop tolerance for inexact factorization preconditioner in WISMP. </p><blockquote class="doxtable">
<p>DPARM(14) in WISMP The valid range for this real option is 0 &le; wsmp_inexact_droptol and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_wsmp_inexact_fillin_limit"></a><a href="#OPT_wsmp_inexact_fillin_limit">&#x25B8;&nbsp;</a><b>wsmp_inexact_fillin_limit</b> (<em>advanced</em>): Fill-in limit for inexact factorization preconditioner in WISMP. </p><blockquote class="doxtable">
<p>DPARM(15) in WISMP The valid range for this real option is 0 &le; wsmp_inexact_fillin_limit and its default value is 0. </p>
</blockquote>
<h2><a class="anchor" id="OPT_Mumps_Linear_Solver"></a>
Mumps Linear Solver</h2>
<p><a class="anchor" id="OPT_mumps_print_level"></a><a href="#OPT_mumps_print_level">&#x25B8;&nbsp;</a><b>mumps_print_level</b>: Debug printing level for the linear solver MUMPS </p><blockquote class="doxtable">
<p>0: no printing; 1: Error messages only; 2: Error, warning, and main statistic messages; 3: Error and warning messages and terse diagnostics; &gt;=4: All information. The valid range for this integer option is 0 &le; mumps_print_level and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_mumps_pivtol"></a><a href="#OPT_mumps_pivtol">&#x25B8;&nbsp;</a><b>mumps_pivtol</b>: Pivot tolerance for the linear solver MUMPS. </p><blockquote class="doxtable">
<p>A smaller number pivots for sparsity, a larger number pivots for stability. The valid range for this real option is 0 &le; mumps_pivtol &le; 1 and its default value is 10<sup>-06</sup>. </p>
</blockquote>
<p><a class="anchor" id="OPT_mumps_pivtolmax"></a><a href="#OPT_mumps_pivtolmax">&#x25B8;&nbsp;</a><b>mumps_pivtolmax</b>: Maximum pivot tolerance for the linear solver MUMPS. </p><blockquote class="doxtable">
<p><a class="el" href="namespaceIpopt.html" title="This file contains a base class for all exceptions and a set of macros to help with exceptions.">Ipopt</a> may increase pivtol as high as pivtolmax to get a more accurate solution to the linear system. The valid range for this real option is 0 &le; mumps_pivtolmax &le; 1 and its default value is 0.1. </p>
</blockquote>
<p><a class="anchor" id="OPT_mumps_mem_percent"></a><a href="#OPT_mumps_mem_percent">&#x25B8;&nbsp;</a><b>mumps_mem_percent</b>: Percentage increase in the estimated working space for MUMPS. </p><blockquote class="doxtable">
<p>When significant extra fill-in is caused by numerical pivoting, larger values of mumps_mem_percent may help use the workspace more efficiently. On the other hand, if memory requirement are too large at the very beginning of the optimization, choosing a much smaller value for this option, such as 5, might reduce memory requirements. The valid range for this integer option is 0 &le; mumps_mem_percent and its default value is 1000. </p>
</blockquote>
<p><a class="anchor" id="OPT_mumps_permuting_scaling"></a><a href="#OPT_mumps_permuting_scaling">&#x25B8;&nbsp;</a><b>mumps_permuting_scaling</b>: Controls permuting and scaling in MUMPS </p><blockquote class="doxtable">
<p>This is ICNTL(6) in MUMPS. The valid range for this integer option is 0 &le; mumps_permuting_scaling &le; 7 and its default value is 7. </p>
</blockquote>
<p><a class="anchor" id="OPT_mumps_pivot_order"></a><a href="#OPT_mumps_pivot_order">&#x25B8;&nbsp;</a><b>mumps_pivot_order</b>: Controls pivot order in MUMPS </p><blockquote class="doxtable">
<p>This is ICNTL(7) in MUMPS. The valid range for this integer option is 0 &le; mumps_pivot_order &le; 7 and its default value is 7. </p>
</blockquote>
<p><a class="anchor" id="OPT_mumps_scaling"></a><a href="#OPT_mumps_scaling">&#x25B8;&nbsp;</a><b>mumps_scaling</b>: Controls scaling in MUMPS </p><blockquote class="doxtable">
<p>This is ICNTL(8) in MUMPS. The valid range for this integer option is -2 &le; mumps_scaling &le; 77 and its default value is 77. </p>
</blockquote>
<p><a class="anchor" id="OPT_mumps_dep_tol"></a><a href="#OPT_mumps_dep_tol">&#x25B8;&nbsp;</a><b>mumps_dep_tol</b> (<em>advanced</em>): Threshold to consider a pivot at zero in detection of linearly dependent constraints with MUMPS. </p><blockquote class="doxtable">
<p>This is CNTL(3) in MUMPS. The valid range for this real option is unrestricted and its default value is 0. </p>
</blockquote>
<p><a class="anchor" id="OPT_mumps_mpi_communicator"></a><a href="#OPT_mumps_mpi_communicator">&#x25B8;&nbsp;</a><b>mumps_mpi_communicator</b> (<em>advanced</em>): MPI communicator used for matrix operations </p><blockquote class="doxtable">
<p>This sets the MPI communicator. MPI_COMM_WORLD is the default. Any other value should be the return value from MPI_Comm_c2f. The valid range for this integer option is unrestricted and its default value is -987654. This option is only available if MUMPS's libseq/mpi.h is not used. </p>
</blockquote>
<h2><a class="anchor" id="OPT_MA28_Linear_Solver"></a>
MA28 Linear Solver</h2>
<p><a class="anchor" id="OPT_ma28_pivtol"></a><a href="#OPT_ma28_pivtol">&#x25B8;&nbsp;</a><b>ma28_pivtol</b>: Pivot tolerance for linear solver MA28. </p><blockquote class="doxtable">
<p>The valid range for this real option is 0 &lt; ma28_pivtol &le; 1 and its default value is 0.01. </p>
</blockquote>
</div></div><!-- contents -->
</div><!-- PageDoc -->
</div><!-- doc-content -->
</body>
</html>
